The number 59959
59959 is a composite number with 4 divisors. Its prime factorisation is 17 × 3527. Divisors (4): 1, 17, 3527, 59959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59959: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 17 × 3527, the product of two primes.
- 2
59959 is composite. Its prime factorisation is
- 3
The divisors add up to 63504; without 59959 itself that is 3545, so 59959 is deficient (3545 is less than 59959). Euler's totient φ(59959) = 56416 numbers up to 59959 share no factor with it.
- 4
The digits of 59959 add up to 37, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 210 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59959 = 17 \times 3527 \]
59959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 63504 |
| Euler totient φ(n) | 56416 |
| Square | 3595081681 |
| Cube | 215557502511079 |
| Square root | 244.865269 |
| Digit sum / digital root | 37 / 1 |
| Collatz steps to 1 | 210 |
| Scientific notation | 5.9959 × |
59959 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand nine hundred and fifty-nine |
| Binary (base 2) | 1110101000110111 |
| Octal (base 8) | 165067 |
| Hexadecimal (base 16) | EA37 |
| Base 3 | 10001020201 |
| As time | 59959 seconds = 16 h 39 min 19 s |
Is 59959 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59959 a prime number?
No. 59959 = 17 × 3527, so it is divisible by 17.
What are the factors of 59959?
1, 17, 3527, 59959.
What is 59959 in binary?
1110101000110111 (hexadecimal EA37, octal 165067).
What is the square root of 59959?
About 244.8653.
Is 59959 divisible by 3?
No. Its digits add up to 37, which is not a multiple of 3.
What is special about the number 59959?
59959 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 17 × 3527, the product of two primes.