The number 11202
11202 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 1867. Divisors (8): 1, 2, 3, 6, 1867, 3734, 5601, 11202.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11202: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 6.
- 2
11202 is composite. Its prime factorisation is
- 3
The divisors add up to 22416; without 11202 itself that is 11214, so 11202 is abundant (11214 is more than 11202). Euler's totient φ(11202) = 3732 numbers up to 11202 share no factor with it.
- 4
The digits of 11202 add up to 6, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11202 = 2 \times 3 \times 1867 \]
11202 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 22416 |
| Euler totient φ(n) | 3732 |
| Square | 125484804 |
| Cube | 1405680774408 |
| Square root | 105.839501 |
| Digit sum / digital root | 6 / 6 |
| Collatz steps to 1 | 68 |
| Scientific notation | 1.1202 × |
11202 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand two hundred and two |
| Binary (base 2) | 10101111000010 |
| Octal (base 8) | 25702 |
| Hexadecimal (base 16) | 2BC2 |
| Base 3 | 120100220 |
| As time | 11202 seconds = 3 h 6 min 42 s |
Is 11202 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11202 ÷ 2 = 5601) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (11202 ÷ 3 = 3734) | 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 | Yes (11202 ÷ 6 = 1867) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 6) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11202 a prime number?
No. 11202 = 2 × 3 × 1867, so it is divisible by 2.
What are the factors of 11202?
1, 2, 3, 6, 1867, 3734, 5601, 11202.
What is 11202 in binary?
10101111000010 (hexadecimal 2BC2, octal 25702).
What is the square root of 11202?
About 105.8395.
Is 11202 divisible by 3?
Yes. Its digits add up to 6, a multiple of 3.
What is special about the number 11202?
11202 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 6.