The number 59495
59495 is a palindrome: it reads 59495 backwards too. Its prime factorisation is 5 × 73 × 163. Divisors (8): 1, 5, 73, 163, 365, 815, 11899, 59495.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59495: a palindrome: it reads 59495 backwards too.
- 2
59495 is composite. Its prime factorisation is
- 3
The divisors add up to 72816; without 59495 itself that is 13321, so 59495 is deficient (13321 is less than 59495). Euler's totient φ(59495) = 46656 numbers up to 59495 share no factor with it.
- 4
The digits of 59495 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59495 = 5 \times 73 \times 163 \]
59495 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 72816 |
| Euler totient φ(n) | 46656 |
| Square | 3539655025 |
| Cube | 210591775712375 |
| Square root | 243.915969 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.9495 × |
59495 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand four hundred and ninety-five |
| Binary (base 2) | 1110100001100111 |
| Octal (base 8) | 164147 |
| Hexadecimal (base 16) | E867 |
| Base 3 | 10000121112 |
| As time | 59495 seconds = 16 h 31 min 35 s |
Is 59495 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 2) | 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 (59495 ÷ 5 = 11899) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 | No (remainder 7) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59495 a prime number?
No. 59495 = 5 × 73 × 163, so it is divisible by 5.
What are the factors of 59495?
1, 5, 73, 163, 365, 815, 11899, 59495.
What is 59495 in binary?
1110100001100111 (hexadecimal E867, octal 164147).
What is the square root of 59495?
About 243.9160.
Is 59495 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 59495?
59495 is a palindrome: it reads 59495 backwards too.