The number 56952
56952 is a composite number with 48 divisors. Its prime factorisation is × × 7 × 113. Divisors (48): 1, 2, 3, 4, 6, 7, 8, 9, 12, 14, 18, 21, 24, 28, 36, 42 … 56952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56952 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56952 is composite. Its prime factorisation is
- 3
The divisors add up to 177840; without 56952 itself that is 120888, so 56952 is abundant (120888 is more than 56952). Euler's totient φ(56952) = 16128 numbers up to 56952 share no factor with it.
- 4
The digits of 56952 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56952 = 2^{3} \times 3^{2} \times 7 \times 113 \]56952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 177840 |
| Euler totient φ(n) | 16128 |
| Square | 3243530304 |
| Cube | 184725537873408 |
| Square root | 238.646182 (= 6√1582) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.6952 × |
56952 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand nine hundred and fifty-two |
| Binary (base 2) | 1101111001111000 |
| Octal (base 8) | 157170 |
| Hexadecimal (base 16) | DE78 |
| Base 3 | 2220010100 |
| As time | 56952 seconds = 15 h 49 min 12 s |
Is 56952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56952 ÷ 2 = 28476) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (56952 ÷ 3 = 18984) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (56952 ÷ 4 = 14238) | 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 (56952 ÷ 6 = 9492) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (56952 ÷ 7 = 8136) | 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 (56952 ÷ 8 = 7119) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (56952 ÷ 9 = 6328) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (56952 ÷ 12 = 4746) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56952 a prime number?
No. 56952 = × × 7 × 113, so it is divisible by 2.
What are the factors of 56952?
1, 2, 3, 4, 6, 7, 8, 9, 12, 14, 18, 21, 24, 28, 36, 42, 56, 63, 72, 84, 113, 126, 168, 226, 252, 339, 452, 504, 678, 791, 904, 1017, 1356, 1582, 2034, 2373, 2712, 3164, 4068, 4746, 6328, 7119, 8136, 9492, 14238, 18984, 28476, 56952.
What is 56952 in binary?
1101111001111000 (hexadecimal DE78, octal 157170).
What is the square root of 56952?
About 238.6462, exactly 6√1582.
Is 56952 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 56952?
It is a composite number with 48 divisors.