The number 64460
64460 is a composite number with 24 divisors. Its prime factorisation is × 5 × 11 × 293. Divisors (24): 1, 2, 4, 5, 10, 11, 20, 22, 44, 55, 110, 220, 293, 586, 1172, 1465 … 64460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 64460: a Harshad number: divisible by its digit sum 20.
- 2
64460 is composite. Its prime factorisation is
- 3
The divisors add up to 148176; without 64460 itself that is 83716, so 64460 is abundant (83716 is more than 64460). Euler's totient φ(64460) = 23360 numbers up to 64460 share no factor with it.
- 4
The digits of 64460 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64460 = 2^{2} \times 5 \times 11 \times 293 \]64460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 148176 |
| Euler totient φ(n) | 23360 |
| Square | 4155091600 |
| Cube | 267837204536000 |
| Square root | 253.889740 (= 2√16115) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 130 |
| Scientific notation | 6.446 × |
64460 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand four hundred and sixty |
| Binary (base 2) | 1111101111001100 |
| Octal (base 8) | 175714 |
| Hexadecimal (base 16) | FBCC |
| Base 3 | 10021102102 |
| As time | 64460 seconds = 17 h 54 min 20 s |
Is 64460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (64460 ÷ 2 = 32230) | 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 | Yes (64460 ÷ 4 = 16115) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (64460 ÷ 5 = 12892) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (64460 ÷ 10 = 6446) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (64460 ÷ 11 = 5860) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64460 a prime number?
No. 64460 = × 5 × 11 × 293, so it is divisible by 2.
What are the factors of 64460?
1, 2, 4, 5, 10, 11, 20, 22, 44, 55, 110, 220, 293, 586, 1172, 1465, 2930, 3223, 5860, 6446, 12892, 16115, 32230, 64460.
What is 64460 in binary?
1111101111001100 (hexadecimal FBCC, octal 175714).
What is the square root of 64460?
About 253.8897, exactly 2√16115.
Is 64460 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 64460?
64460 is a Harshad number: divisible by its digit sum 20.