The number 64005
64005 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 17 × 251. Divisors (16): 1, 3, 5, 15, 17, 51, 85, 251, 255, 753, 1255, 3765, 4267, 12801, 21335, 64005.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 64005: a Harshad number: divisible by its digit sum 15.
- 2
64005 is composite. Its prime factorisation is
- 3
The divisors add up to 108864; without 64005 itself that is 44859, so 64005 is deficient (44859 is less than 64005). Euler's totient φ(64005) = 32000 numbers up to 64005 share no factor with it.
- 4
The digits of 64005 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64005 = 3 \times 5 \times 17 \times 251 \]
64005 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 108864 |
| Euler totient φ(n) | 32000 |
| Square | 4096640025 |
| Cube | 262205444800125 |
| Square root | 252.992095 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 148 |
| Scientific notation | 6.4005 × |
64005 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand and five |
| Binary (base 2) | 1111101000000101 |
| Octal (base 8) | 175005 |
| Hexadecimal (base 16) | FA05 |
| Base 3 | 10020210120 |
| As time | 64005 seconds = 17 h 46 min 45 s |
Is 64005 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 (64005 ÷ 3 = 21335) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (64005 ÷ 5 = 12801) | 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 4) | 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 5) | 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 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64005 a prime number?
No. 64005 = 3 × 5 × 17 × 251, so it is divisible by 3.
What are the factors of 64005?
1, 3, 5, 15, 17, 51, 85, 251, 255, 753, 1255, 3765, 4267, 12801, 21335, 64005.
What is 64005 in binary?
1111101000000101 (hexadecimal FA05, octal 175005).
What is the square root of 64005?
About 252.9921.
Is 64005 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 64005?
64005 is a Harshad number: divisible by its digit sum 15.