The number 64480
64480 is a composite number with 48 divisors. Its prime factorisation is × 5 × 13 × 31. Divisors (48): 1, 2, 4, 5, 8, 10, 13, 16, 20, 26, 31, 32, 40, 52, 62, 65 … 64480.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
64480 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
64480 is composite. Its prime factorisation is
- 3
The divisors add up to 169344; without 64480 itself that is 104864, so 64480 is abundant (104864 is more than 64480). Euler's totient φ(64480) = 23040 numbers up to 64480 share no factor with it.
- 4
The digits of 64480 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 99 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64480 = 2^{5} \times 5 \times 13 \times 31 \]64480 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 169344 |
| Euler totient φ(n) | 23040 |
| Square | 4157670400 |
| Cube | 268086587392000 |
| Square root | 253.929124 (= 4√4030) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 99 |
| Scientific notation | 6.448 × |
64480 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand four hundred and eighty |
| Binary (base 2) | 1111101111100000 |
| Octal (base 8) | 175740 |
| Hexadecimal (base 16) | FBE0 |
| Base 3 | 10021110011 |
| As time | 64480 seconds = 17 h 54 min 40 s |
Is 64480 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (64480 ÷ 2 = 32240) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (64480 ÷ 4 = 16120) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (64480 ÷ 5 = 12896) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 (64480 ÷ 8 = 8060) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (64480 ÷ 10 = 6448) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64480 a prime number?
No. 64480 = × 5 × 13 × 31, so it is divisible by 2.
What are the factors of 64480?
1, 2, 4, 5, 8, 10, 13, 16, 20, 26, 31, 32, 40, 52, 62, 65, 80, 104, 124, 130, 155, 160, 208, 248, 260, 310, 403, 416, 496, 520, 620, 806, 992, 1040, 1240, 1612, 2015, 2080, 2480, 3224, 4030, 4960, 6448, 8060, 12896, 16120, 32240, 64480.
What is 64480 in binary?
1111101111100000 (hexadecimal FBE0, octal 175740).
What is the square root of 64480?
About 253.9291, exactly 4√4030.
Is 64480 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 64480?
It is a composite number with 48 divisors.