The number 11502
11502 is a composite number with 20 divisors. Its prime factorisation is 2 × × 71. Divisors (20): 1, 2, 3, 6, 9, 18, 27, 54, 71, 81, 142, 162, 213, 426, 639, 1278 … 11502.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11502: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.
- 2
11502 is composite. Its prime factorisation is
- 3
The divisors add up to 26136; without 11502 itself that is 14634, so 11502 is abundant (14634 is more than 11502). Euler's totient φ(11502) = 3780 numbers up to 11502 share no factor with it.
- 4
The digits of 11502 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11502 = 2 \times 3^{4} \times 71 \]11502 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 26136 |
| Euler totient φ(n) | 3780 |
| Square | 132296004 |
| Cube | 1521668638008 |
| Square root | 107.247378 (= 9√142) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 55 |
| Scientific notation | 1.1502 × |
11502 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand five hundred and two |
| Binary (base 2) | 10110011101110 |
| Octal (base 8) | 26356 |
| Hexadecimal (base 16) | 2CEE |
| Base 3 | 120210000 |
| As time | 11502 seconds = 3 h 11 min 42 s |
Is 11502 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11502 ÷ 2 = 5751) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (11502 ÷ 3 = 3834) | 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 (11502 ÷ 6 = 1917) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 | Yes (11502 ÷ 9 = 1278) | 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 7) | 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 11502 a prime number?
No. 11502 = 2 × × 71, so it is divisible by 2.
What are the factors of 11502?
1, 2, 3, 6, 9, 18, 27, 54, 71, 81, 142, 162, 213, 426, 639, 1278, 1917, 3834, 5751, 11502.
What is 11502 in binary?
10110011101110 (hexadecimal 2CEE, octal 26356).
What is the square root of 11502?
About 107.2474, exactly 9√142.
Is 11502 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 11502?
11502 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.