The number 65059
65059 is a composite number with 8 divisors. Its prime factorisation is 17 × 43 × 89. Divisors (8): 1, 17, 43, 89, 731, 1513, 3827, 65059.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 65059: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
65059 is composite. Its prime factorisation is
- 3
The divisors add up to 71280; without 65059 itself that is 6221, so 65059 is deficient (6221 is less than 65059). Euler's totient φ(65059) = 59136 numbers up to 65059 share no factor with it.
- 4
The digits of 65059 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 65059 = 17 \times 43 \times 89 \]
65059 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 71280 |
| Euler totient φ(n) | 59136 |
| Square | 4232673481 |
| Cube | 275373504000379 |
| Square root | 255.066658 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 130 |
| Scientific notation | 6.5059 × |
65059 in other forms
| Form | Value |
|---|---|
| In words | sixty-five thousand and fifty-nine |
| Binary (base 2) | 1111111000100011 |
| Octal (base 8) | 177043 |
| Hexadecimal (base 16) | FE23 |
| Base 3 | 10022020121 |
| As time | 65059 seconds = 18 h 4 min 19 s |
Is 65059 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 1) | 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 7) | 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 5) | 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 65059 a prime number?
No. 65059 = 17 × 43 × 89, so it is divisible by 17.
What are the factors of 65059?
1, 17, 43, 89, 731, 1513, 3827, 65059.
What is 65059 in binary?
1111111000100011 (hexadecimal FE23, octal 177043).
What is the square root of 65059?
About 255.0667.
Is 65059 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 65059?
65059 is a happy number: repeatedly adding the squares of its digits reaches 1.