The number 59152
59152 is a composite number with 10 divisors. Its prime factorisation is × 3697. Divisors (10): 1, 2, 4, 8, 16, 3697, 7394, 14788, 29576, 59152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59152 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59152 is composite. Its prime factorisation is
- 3
The divisors add up to 114638; without 59152 itself that is 55486, so 59152 is deficient (55486 is less than 59152). Euler's totient φ(59152) = 29568 numbers up to 59152 share no factor with it.
- 4
The digits of 59152 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 42 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59152 = 2^{4} \times 3697 \]59152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 114638 |
| Euler totient φ(n) | 29568 |
| Square | 3498959104 |
| Cube | 206970428919808 |
| Square root | 243.211842 (= 4√3697) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 42 |
| Scientific notation | 5.9152 × |
59152 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand one hundred and fifty-two |
| Binary (base 2) | 1110011100010000 |
| Octal (base 8) | 163420 |
| Hexadecimal (base 16) | E710 |
| Base 3 | 10000010211 |
| As time | 59152 seconds = 16 h 25 min 52 s |
Is 59152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59152 ÷ 2 = 29576) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (59152 ÷ 4 = 14788) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 (59152 ÷ 8 = 7394) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59152 a prime number?
No. 59152 = × 3697, so it is divisible by 2.
What are the factors of 59152?
1, 2, 4, 8, 16, 3697, 7394, 14788, 29576, 59152.
What is 59152 in binary?
1110011100010000 (hexadecimal E710, octal 163420).
What is the square root of 59152?
About 243.2118, exactly 4√3697.
Is 59152 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 59152?
It is a composite number with 10 divisors.