The number 23152
23152 is a composite number with 10 divisors. Its prime factorisation is × 1447. Divisors (10): 1, 2, 4, 8, 16, 1447, 2894, 5788, 11576, 23152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
23152 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
23152 is composite. Its prime factorisation is
- 3
The divisors add up to 44888; without 23152 itself that is 21736, so 23152 is deficient (21736 is less than 23152). Euler's totient φ(23152) = 11568 numbers up to 23152 share no factor with it.
- 4
The digits of 23152 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 56 steps to reach 1.
LaTeX source of the formulas on this page
\[ 23152 = 2^{4} \times 1447 \]23152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 44888 |
| Euler totient φ(n) | 11568 |
| Square | 536015104 |
| Cube | 12409821687808 |
| Square root | 152.157813 (= 4√1447) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 56 |
| Scientific notation | 2.3152 × |
23152 in other forms
| Form | Value |
|---|---|
| In words | twenty-three thousand one hundred and fifty-two |
| Binary (base 2) | 101101001110000 |
| Octal (base 8) | 55160 |
| Hexadecimal (base 16) | 5A70 |
| Base 3 | 1011202111 |
| As time | 23152 seconds = 6 h 25 min 52 s |
Is 23152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (23152 ÷ 2 = 11576) | 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 | Yes (23152 ÷ 4 = 5788) | 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 3) | 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 (23152 ÷ 8 = 2894) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 23152 a prime number?
No. 23152 = × 1447, so it is divisible by 2.
What are the factors of 23152?
1, 2, 4, 8, 16, 1447, 2894, 5788, 11576, 23152.
What is 23152 in binary?
101101001110000 (hexadecimal 5A70, octal 55160).
What is the square root of 23152?
About 152.1578, exactly 4√1447.
Is 23152 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 23152?
It is a composite number with 10 divisors.