The number 11102
11102 is a composite number with 16 divisors. Its prime factorisation is 2 × 7 × 13 × 61. Divisors (16): 1, 2, 7, 13, 14, 26, 61, 91, 122, 182, 427, 793, 854, 1586, 5551, 11102.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11102: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
11102 is composite. Its prime factorisation is
- 3
The divisors add up to 20832; without 11102 itself that is 9730, so 11102 is deficient (9730 is less than 11102). Euler's totient φ(11102) = 4320 numbers up to 11102 share no factor with it.
- 4
The digits of 11102 add up to 5, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11102 = 2 \times 7 \times 13 \times 61 \]
11102 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 20832 |
| Euler totient φ(n) | 4320 |
| Square | 123254404 |
| Cube | 1368370393208 |
| Square root | 105.366029 |
| Digit sum / digital root | 5 / 5 |
| Collatz steps to 1 | 68 |
| Scientific notation | 1.1102 × |
11102 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand one hundred and two |
| Binary (base 2) | 10101101011110 |
| Octal (base 8) | 25536 |
| Hexadecimal (base 16) | 2B5E |
| Base 3 | 120020012 |
| As time | 11102 seconds = 3 h 5 min 2 s |
Is 11102 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11102 ÷ 2 = 5551) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (11102 ÷ 7 = 1586) | A number is divisible by 7 if double the last digit and subtract it from the rest: the result is a multiple of 7. |
| 8 | No (remainder 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11102 a prime number?
No. 11102 = 2 × 7 × 13 × 61, so it is divisible by 2.
What are the factors of 11102?
1, 2, 7, 13, 14, 26, 61, 91, 122, 182, 427, 793, 854, 1586, 5551, 11102.
What is 11102 in binary?
10101101011110 (hexadecimal 2B5E, octal 25536).
What is the square root of 11102?
About 105.3660.
Is 11102 divisible by 3?
No. Its digits add up to 5, which is not a multiple of 3.
What is special about the number 11102?
11102 is a happy number: repeatedly adding the squares of its digits reaches 1.