The number 57152
57152 is a composite number with 28 divisors. Its prime factorisation is × 19 × 47. Divisors (28): 1, 2, 4, 8, 16, 19, 32, 38, 47, 64, 76, 94, 152, 188, 304, 376 … 57152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
57152 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
57152 is composite. Its prime factorisation is
- 3
The divisors add up to 121920; without 57152 itself that is 64768, so 57152 is abundant (64768 is more than 57152). Euler's totient φ(57152) = 26496 numbers up to 57152 share no factor with it.
- 4
The digits of 57152 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 57152 = 2^{6} \times 19 \times 47 \]57152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 28 |
| Sum of divisors | 121920 |
| Euler totient φ(n) | 26496 |
| Square | 3266351104 |
| Cube | 186678498295808 |
| Square root | 239.064845 (= 8√893) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.7152 × |
57152 in other forms
| Form | Value |
|---|---|
| In words | fifty-seven thousand one hundred and fifty-two |
| Binary (base 2) | 1101111101000000 |
| Octal (base 8) | 157500 |
| Hexadecimal (base 16) | DF40 |
| Base 3 | 2220101202 |
| As time | 57152 seconds = 15 h 52 min 32 s |
Is 57152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (57152 ÷ 2 = 28576) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (57152 ÷ 4 = 14288) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 (57152 ÷ 8 = 7144) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 57152 a prime number?
No. 57152 = × 19 × 47, so it is divisible by 2.
What are the factors of 57152?
1, 2, 4, 8, 16, 19, 32, 38, 47, 64, 76, 94, 152, 188, 304, 376, 608, 752, 893, 1216, 1504, 1786, 3008, 3572, 7144, 14288, 28576, 57152.
What is 57152 in binary?
1101111101000000 (hexadecimal DF40, octal 157500).
What is the square root of 57152?
About 239.0648, exactly 8√893.
Is 57152 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 57152?
It is a composite number with 28 divisors.