The number 64496
64496 is a composite number with 20 divisors. Its prime factorisation is × 29 × 139. Divisors (20): 1, 2, 4, 8, 16, 29, 58, 116, 139, 232, 278, 464, 556, 1112, 2224, 4031 … 64496.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 64496: a Harshad number: divisible by its digit sum 29.
- 2
64496 is composite. Its prime factorisation is
- 3
The divisors add up to 130200; without 64496 itself that is 65704, so 64496 is abundant (65704 is more than 64496). Euler's totient φ(64496) = 30912 numbers up to 64496 share no factor with it.
- 4
The digits of 64496 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 99 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64496 = 2^{4} \times 29 \times 139 \]64496 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 130200 |
| Euler totient φ(n) | 30912 |
| Square | 4159734016 |
| Cube | 268286205095936 |
| Square root | 253.960627 (= 4√4031) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 99 |
| Scientific notation | 6.4496 × |
64496 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand four hundred and ninety-six |
| Binary (base 2) | 1111101111110000 |
| Octal (base 8) | 175760 |
| Hexadecimal (base 16) | FBF0 |
| Base 3 | 10021110202 |
| As time | 64496 seconds = 17 h 54 min 56 s |
Is 64496 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (64496 ÷ 2 = 32248) | 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 (64496 ÷ 4 = 16124) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 5) | 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 (64496 ÷ 8 = 8062) | 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 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 64496 a prime number?
No. 64496 = × 29 × 139, so it is divisible by 2.
What are the factors of 64496?
1, 2, 4, 8, 16, 29, 58, 116, 139, 232, 278, 464, 556, 1112, 2224, 4031, 8062, 16124, 32248, 64496.
What is 64496 in binary?
1111101111110000 (hexadecimal FBF0, octal 175760).
What is the square root of 64496?
About 253.9606, exactly 4√4031.
Is 64496 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 64496?
64496 is a Harshad number: divisible by its digit sum 29.