The number 64640
64640 is a composite number with 32 divisors. Its prime factorisation is × 5 × 101. Divisors (32): 1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 64, 80, 101, 128, 160, 202 … 64640.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 64640: a Harshad number: divisible by its digit sum 20.
- 2
64640 is composite. Its prime factorisation is
- 3
The divisors add up to 156060; without 64640 itself that is 91420, so 64640 is abundant (91420 is more than 64640). Euler's totient φ(64640) = 25600 numbers up to 64640 share no factor with it.
- 4
The digits of 64640 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 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64640 = 2^{7} \times 5 \times 101 \]64640 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 156060 |
| Euler totient φ(n) | 25600 |
| Square | 4178329600 |
| Cube | 270087225344000 |
| Square root | 254.243977 (= 8√1010) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 68 |
| Scientific notation | 6.464 × |
64640 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand six hundred and forty |
| Binary (base 2) | 1111110010000000 |
| Octal (base 8) | 176200 |
| Hexadecimal (base 16) | FC80 |
| Base 3 | 10021200002 |
| As time | 64640 seconds = 17 h 57 min 20 s |
Is 64640 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (64640 ÷ 2 = 32320) | 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 (64640 ÷ 4 = 16160) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (64640 ÷ 5 = 12928) | 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 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 | Yes (64640 ÷ 8 = 8080) | 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 (64640 ÷ 10 = 6464) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64640 a prime number?
No. 64640 = × 5 × 101, so it is divisible by 2.
What are the factors of 64640?
1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 64, 80, 101, 128, 160, 202, 320, 404, 505, 640, 808, 1010, 1616, 2020, 3232, 4040, 6464, 8080, 12928, 16160, 32320, 64640.
What is 64640 in binary?
1111110010000000 (hexadecimal FC80, octal 176200).
What is the square root of 64640?
About 254.2440, exactly 8√1010.
Is 64640 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 64640?
64640 is a Harshad number: divisible by its digit sum 20.