1102 is a positive integer that follows 1101 and precedes 1103. In basic classification it is an even, composite number; in more specific terms it is the product of three distinct primes and therefore a sphenic number.
Prime factorization and divisors
The prime factorization of 1102 is 2 × 19 × 29. Because it is the product of three distinct primes, it has eight positive divisors. The full divisor set is: 1, 2, 19, 29, 38, 58, 551 and 1102. The sum of all divisors (the sigma function) equals 1800, so the sum of proper divisors (the aliquot sum) is 698; since 698 < 1102, the number is classified as deficient.
Arithmetic functions and properties
Its Euler totient φ(1102) = 504, which counts integers up to 1102 that are coprime with it. Because one of its prime factors (19) is congruent to 3 mod 4 and occurs with odd exponent, 1102 cannot be expressed as the sum of two integer squares. It is not a perfect power, not triangular, and not a Harshad number in base 10 (the sum of its digits is 4 and 1102 is not divisible by 4).
Representations in other systems
- Binary: 10001001110
- Octal: 2116
- Hexadecimal: 44E
- Roman numerals: MCII
These alternative representations are commonly used in computing and historical notation and help illustrate how the number appears in different contexts.
Occurrences and contextual notes
Aside from its mathematical identity, the sequence of digits 1102 may appear as a year (AD 1102) or as an identifier in catalogs, model numbers, or codes. When referenced as a year, it pertains to historical events in the early 12th century; when used as an identifier it carries no inherent mathematical meaning beyond the integer it denotes.