The number 11002
11002 is a composite number with 4 divisors. Its prime factorisation is 2 × 5501. Divisors (4): 1, 2, 5501, 11002.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11002: a semiprime: 2 × 5501, the product of two primes.
- 2
11002 is composite. Its prime factorisation is
- 3
The divisors add up to 16506; without 11002 itself that is 5504, so 11002 is deficient (5504 is less than 11002). Euler's totient φ(11002) = 5500 numbers up to 11002 share no factor with it.
- 4
The digits of 11002 add up to 4, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 42 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11002 = 2 \times 5501 \]
11002 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16506 |
| Euler totient φ(n) | 5500 |
| Square | 121044004 |
| Cube | 1331726132008 |
| Square root | 104.890419 |
| Digit sum / digital root | 4 / 4 |
| Collatz steps to 1 | 42 |
| Scientific notation | 1.1002 × |
11002 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand and two |
| Binary (base 2) | 10101011111010 |
| Octal (base 8) | 25372 |
| Hexadecimal (base 16) | 2AFA |
| Base 3 | 120002111 |
| As time | 11002 seconds = 3 h 3 min 22 s |
Is 11002 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11002 ÷ 2 = 5501) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11002 a prime number?
No. 11002 = 2 × 5501, so it is divisible by 2.
What are the factors of 11002?
1, 2, 5501, 11002.
What is 11002 in binary?
10101011111010 (hexadecimal 2AFA, octal 25372).
What is the square root of 11002?
About 104.8904.
Is 11002 divisible by 3?
No. Its digits add up to 4, which is not a multiple of 3.
What is special about the number 11002?
11002 is a semiprime: 2 × 5501, the product of two primes.