The number 59552
59552 is a composite number with 12 divisors. Its prime factorisation is × 1861. Divisors (12): 1, 2, 4, 8, 16, 32, 1861, 3722, 7444, 14888, 29776, 59552.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59552 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59552 is composite. Its prime factorisation is
- 3
The divisors add up to 117306; without 59552 itself that is 57754, so 59552 is deficient (57754 is less than 59552). Euler's totient φ(59552) = 29760 numbers up to 59552 share no factor with it.
- 4
The digits of 59552 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 42 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59552 = 2^{5} \times 1861 \]59552 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 117306 |
| Euler totient φ(n) | 29760 |
| Square | 3546440704 |
| Cube | 211197636804608 |
| Square root | 244.032785 (= 4√3722) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 42 |
| Scientific notation | 5.9552 × |
59552 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand five hundred and fifty-two |
| Binary (base 2) | 1110100010100000 |
| Octal (base 8) | 164240 |
| Hexadecimal (base 16) | E8A0 |
| Base 3 | 10000200122 |
| As time | 59552 seconds = 16 h 32 min 32 s |
Is 59552 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59552 ÷ 2 = 29776) | 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 (59552 ÷ 4 = 14888) | 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 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 (59552 ÷ 8 = 7444) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 9) | 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 59552 a prime number?
No. 59552 = × 1861, so it is divisible by 2.
What are the factors of 59552?
1, 2, 4, 8, 16, 32, 1861, 3722, 7444, 14888, 29776, 59552.
What is 59552 in binary?
1110100010100000 (hexadecimal E8A0, octal 164240).
What is the square root of 59552?
About 244.0328, exactly 4√3722.
Is 59552 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 59552?
It is a composite number with 12 divisors.