The number 10152
10152 is a composite number with 32 divisors. Its prime factorisation is × × 47. Divisors (32): 1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 27, 36, 47, 54, 72, 94 … 10152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10152: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.
- 2
10152 is composite. Its prime factorisation is
- 3
The divisors add up to 28800; without 10152 itself that is 18648, so 10152 is abundant (18648 is more than 10152). Euler's totient φ(10152) = 3312 numbers up to 10152 share no factor with it.
- 4
The digits of 10152 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 42 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10152 = 2^{3} \times 3^{3} \times 47 \]10152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 28800 |
| Euler totient φ(n) | 3312 |
| Square | 103063104 |
| Cube | 1046296631808 |
| Square root | 100.757134 (= 6√282) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 42 |
| Scientific notation | 1.0152 × |
10152 in other forms
| Form | Value |
|---|---|
| In words | ten thousand one hundred and fifty-two |
| Binary (base 2) | 10011110101000 |
| Octal (base 8) | 23650 |
| Hexadecimal (base 16) | 27A8 |
| Base 3 | 111221000 |
| As time | 10152 seconds = 2 h 49 min 12 s |
Is 10152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10152 ÷ 2 = 5076) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (10152 ÷ 3 = 3384) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (10152 ÷ 4 = 2538) | 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 (10152 ÷ 6 = 1692) | 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 | Yes (10152 ÷ 8 = 1269) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (10152 ÷ 9 = 1128) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (10152 ÷ 12 = 846) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10152 a prime number?
No. 10152 = × × 47, so it is divisible by 2.
What are the factors of 10152?
1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 27, 36, 47, 54, 72, 94, 108, 141, 188, 216, 282, 376, 423, 564, 846, 1128, 1269, 1692, 2538, 3384, 5076, 10152.
What is 10152 in binary?
10011110101000 (hexadecimal 27A8, octal 23650).
What is the square root of 10152?
About 100.7571, exactly 6√282.
Is 10152 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 10152?
10152 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.