The number 64059
64059 is a composite number with 8 divisors. Its prime factorisation is 3 × 131 × 163. Divisors (8): 1, 3, 131, 163, 393, 489, 21353, 64059.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
64059 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
64059 is composite. Its prime factorisation is
- 3
The divisors add up to 86592; without 64059 itself that is 22533, so 64059 is deficient (22533 is less than 64059). Euler's totient φ(64059) = 42120 numbers up to 64059 share no factor with it.
- 4
The digits of 64059 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64059 = 3 \times 131 \times 163 \]
64059 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 86592 |
| Euler totient φ(n) | 42120 |
| Square | 4103555481 |
| Cube | 262869660557379 |
| Square root | 253.098795 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 47 |
| Scientific notation | 6.4059 × |
64059 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand and fifty-nine |
| Binary (base 2) | 1111101000111011 |
| Octal (base 8) | 175073 |
| Hexadecimal (base 16) | FA3B |
| Base 3 | 10020212120 |
| As time | 64059 seconds = 17 h 47 min 39 s |
Is 64059 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 (64059 ÷ 3 = 21353) | 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 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 3) | 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 6) | 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 64059 a prime number?
No. 64059 = 3 × 131 × 163, so it is divisible by 3.
What are the factors of 64059?
1, 3, 131, 163, 393, 489, 21353, 64059.
What is 64059 in binary?
1111101000111011 (hexadecimal FA3B, octal 175073).
What is the square root of 64059?
About 253.0988.
Is 64059 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 64059?
It is a composite number with 8 divisors.