The number 64959
64959 is a binary palindrome (1111110110111111). Its prime factorisation is 3 × 59 × 367. Divisors (8): 1, 3, 59, 177, 367, 1101, 21653, 64959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 64959: a binary palindrome (1111110110111111); a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
64959 is composite. Its prime factorisation is
- 3
The divisors add up to 88320; without 64959 itself that is 23361, so 64959 is deficient (23361 is less than 64959). Euler's totient φ(64959) = 42456 numbers up to 64959 share no factor with it.
- 4
The digits of 64959 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 86 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64959 = 3 \times 59 \times 367 \]
64959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 88320 |
| Euler totient φ(n) | 42456 |
| Square | 4219671681 |
| Cube | 274105652726079 |
| Square root | 254.870555 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 86 |
| Scientific notation | 6.4959 × |
64959 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand nine hundred and fifty-nine |
| Binary (base 2) | 1111110110111111 |
| Octal (base 8) | 176677 |
| Hexadecimal (base 16) | FDBF |
| Base 3 | 10022002220 |
| As time | 64959 seconds = 18 h 2 min 39 s |
Is 64959 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 | Yes (64959 ÷ 3 = 21653) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 6) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64959 a prime number?
No. 64959 = 3 × 59 × 367, so it is divisible by 3.
What are the factors of 64959?
1, 3, 59, 177, 367, 1101, 21653, 64959.
What is 64959 in binary?
1111110110111111 (hexadecimal FDBF, octal 176677).
What is the square root of 64959?
About 254.8706.
Is 64959 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 64959?
64959 is a binary palindrome (1111110110111111); a happy number: repeatedly adding the squares of its digits reaches 1.