The number 59252
59252 is a composite number with 6 divisors. Its prime factorisation is × 14813. Divisors (6): 1, 2, 4, 14813, 29626, 59252.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59252: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
59252 is composite. Its prime factorisation is
- 3
The divisors add up to 103698; without 59252 itself that is 44446, so 59252 is deficient (44446 is less than 59252). Euler's totient φ(59252) = 29624 numbers up to 59252 share no factor with it.
- 4
The digits of 59252 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59252 = 2^{2} \times 14813 \]59252 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 103698 |
| Euler totient φ(n) | 29624 |
| Square | 3510799504 |
| Cube | 208021892211008 |
| Square root | 243.417337 (= 2√14813) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 135 |
| Scientific notation | 5.9252 × |
59252 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand two hundred and fifty-two |
| Binary (base 2) | 1110011101110100 |
| Octal (base 8) | 163564 |
| Hexadecimal (base 16) | E774 |
| Base 3 | 10000021112 |
| As time | 59252 seconds = 16 h 27 min 32 s |
Is 59252 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59252 ÷ 2 = 29626) | 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 (59252 ÷ 4 = 14813) | 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 6) | 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 59252 a prime number?
No. 59252 = × 14813, so it is divisible by 2.
What are the factors of 59252?
1, 2, 4, 14813, 29626, 59252.
What is 59252 in binary?
1110011101110100 (hexadecimal E774, octal 163564).
What is the square root of 59252?
About 243.4173, exactly 2√14813.
Is 59252 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 59252?
59252 is a happy number: repeatedly adding the squares of its digits reaches 1.