The number 59995
59995 is a palindrome: it reads 59995 backwards too. Its prime factorisation is 5 × × 71. Divisors (12): 1, 5, 13, 65, 71, 169, 355, 845, 923, 4615, 11999, 59995.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59995: a palindrome: it reads 59995 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
59995 is composite. Its prime factorisation is
- 3
The divisors add up to 79056; without 59995 itself that is 19061, so 59995 is deficient (19061 is less than 59995). Euler's totient φ(59995) = 43680 numbers up to 59995 share no factor with it.
- 4
The digits of 59995 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 197 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59995 = 5 \times 13^{2} \times 71 \]59995 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 79056 |
| Euler totient φ(n) | 43680 |
| Square | 3599400025 |
| Cube | 215946004499875 |
| Square root | 244.938768 (= 13√355) |
| Digit sum / digital root | 37 / 1 |
| Collatz steps to 1 | 197 |
| Scientific notation | 5.9995 × |
59995 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand nine hundred and ninety-five |
| Binary (base 2) | 1110101001011011 |
| Octal (base 8) | 165133 |
| Hexadecimal (base 16) | EA5B |
| Base 3 | 10001022001 |
| As time | 59995 seconds = 16 h 39 min 55 s |
Is 59995 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 | Yes (59995 ÷ 5 = 11999) | 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 5) | 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 3) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 59995 a prime number?
No. 59995 = 5 × × 71, so it is divisible by 5.
What are the factors of 59995?
1, 5, 13, 65, 71, 169, 355, 845, 923, 4615, 11999, 59995.
What is 59995 in binary?
1110101001011011 (hexadecimal EA5B, octal 165133).
What is the square root of 59995?
About 244.9388, exactly 13√355.
Is 59995 divisible by 3?
No. Its digits add up to 37, which is not a multiple of 3.
What is special about the number 59995?
59995 is a palindrome: it reads 59995 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1.