The number 59952
59952 is a composite number with 20 divisors. Its prime factorisation is × 3 × 1249. Divisors (20): 1, 2, 3, 4, 6, 8, 12, 16, 24, 48, 1249, 2498, 3747, 4996, 7494, 9992 … 59952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59952 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59952 is composite. Its prime factorisation is
- 3
The divisors add up to 155000; without 59952 itself that is 95048, so 59952 is abundant (95048 is more than 59952). Euler's totient φ(59952) = 19968 numbers up to 59952 share no factor with it.
- 4
The digits of 59952 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59952 = 2^{4} \times 3 \times 1249 \]59952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 155000 |
| Euler totient φ(n) | 19968 |
| Square | 3594242304 |
| Cube | 215482014609408 |
| Square root | 244.850975 (= 4√3747) |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.9952 × |
59952 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand nine hundred and fifty-two |
| Binary (base 2) | 1110101000110000 |
| Octal (base 8) | 165060 |
| Hexadecimal (base 16) | EA30 |
| Base 3 | 10001020110 |
| As time | 59952 seconds = 16 h 39 min 12 s |
Is 59952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59952 ÷ 2 = 29976) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (59952 ÷ 3 = 19984) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (59952 ÷ 4 = 14988) | 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 (59952 ÷ 6 = 9992) | 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 (59952 ÷ 8 = 7494) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (59952 ÷ 12 = 4996) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59952 a prime number?
No. 59952 = × 3 × 1249, so it is divisible by 2.
What are the factors of 59952?
1, 2, 3, 4, 6, 8, 12, 16, 24, 48, 1249, 2498, 3747, 4996, 7494, 9992, 14988, 19984, 29976, 59952.
What is 59952 in binary?
1110101000110000 (hexadecimal EA30, octal 165060).
What is the square root of 59952?
About 244.8510, exactly 4√3747.
Is 59952 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 59952?
It is a composite number with 20 divisors.