The number 8480
8480 is a composite number with 24 divisors. Its prime factorisation is × 5 × 53. Divisors (24): 1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 53, 80, 106, 160, 212, 265 … 8480.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 8480: a Harshad number: divisible by its digit sum 20.
- 2
8480 is composite. Its prime factorisation is
- 3
The divisors add up to 20412; without 8480 itself that is 11932, so 8480 is abundant (11932 is more than 8480). Euler's totient φ(8480) = 3328 numbers up to 8480 share no factor with it.
- 4
The digits of 8480 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 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 8480 = 2^{5} \times 5 \times 53 \]8480 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 20412 |
| Euler totient φ(n) | 3328 |
| Square | 71910400 |
| Cube | 609800192000 |
| Square root | 92.086915 (= 4√530) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 127 |
| Scientific notation | 8.48 × |
8480 in other forms
| Form | Value |
|---|---|
| In words | eight thousand four hundred and eighty |
| Binary (base 2) | 10000100100000 |
| Octal (base 8) | 20440 |
| Hexadecimal (base 16) | 2120 |
| Base 3 | 102122002 |
| As time | 8480 seconds = 2 h 21 min 20 s |
Is 8480 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (8480 ÷ 2 = 4240) | 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 (8480 ÷ 4 = 2120) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (8480 ÷ 5 = 1696) | 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 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 (8480 ÷ 8 = 1060) | 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 (8480 ÷ 10 = 848) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 8480 a prime number?
No. 8480 = × 5 × 53, so it is divisible by 2.
What are the factors of 8480?
1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 53, 80, 106, 160, 212, 265, 424, 530, 848, 1060, 1696, 2120, 4240, 8480.
What is 8480 in binary?
10000100100000 (hexadecimal 2120, octal 20440).
What is the square root of 8480?
About 92.0869, exactly 4√530.
Is 8480 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 8480?
8480 is a Harshad number: divisible by its digit sum 20.