The number 25152
25152 is a palindrome: it reads 25152 backwards too. Its prime factorisation is × 3 × 131. Divisors (28): 1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 131, 192, 262 … 25152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 25152: a palindrome: it reads 25152 backwards too.
- 2
25152 is composite. Its prime factorisation is
- 3
The divisors add up to 67056; without 25152 itself that is 41904, so 25152 is abundant (41904 is more than 25152). Euler's totient φ(25152) = 8320 numbers up to 25152 share no factor with it.
- 4
The digits of 25152 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 64 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25152 = 2^{6} \times 3 \times 131 \]25152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 28 |
| Sum of divisors | 67056 |
| Euler totient φ(n) | 8320 |
| Square | 632623104 |
| Cube | 15911736311808 |
| Square root | 158.593821 (= 8√393) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 64 |
| Scientific notation | 2.5152 × |
25152 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand one hundred and fifty-two |
| Binary (base 2) | 110001001000000 |
| Octal (base 8) | 61100 |
| Hexadecimal (base 16) | 6240 |
| Base 3 | 1021111120 |
| As time | 25152 seconds = 6 h 59 min 12 s |
Is 25152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (25152 ÷ 2 = 12576) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (25152 ÷ 3 = 8384) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (25152 ÷ 4 = 6288) | 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 (25152 ÷ 6 = 4192) | 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 | Yes (25152 ÷ 8 = 3144) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (25152 ÷ 12 = 2096) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 25152 a prime number?
No. 25152 = × 3 × 131, so it is divisible by 2.
What are the factors of 25152?
1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 131, 192, 262, 393, 524, 786, 1048, 1572, 2096, 3144, 4192, 6288, 8384, 12576, 25152.
What is 25152 in binary?
110001001000000 (hexadecimal 6240, octal 61100).
What is the square root of 25152?
About 158.5938, exactly 8√393.
Is 25152 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 25152?
25152 is a palindrome: it reads 25152 backwards too.