The number 80480
80480 is a composite number with 24 divisors. Its prime factorisation is × 5 × 503. Divisors (24): 1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 80, 160, 503, 1006, 2012, 2515 … 80480.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 80480: a Harshad number: divisible by its digit sum 20.
- 2
80480 is composite. Its prime factorisation is
- 3
The divisors add up to 190512; without 80480 itself that is 110032, so 80480 is abundant (110032 is more than 80480). Euler's totient φ(80480) = 32128 numbers up to 80480 share no factor with it.
- 4
The digits of 80480 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 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80480 = 2^{5} \times 5 \times 503 \]80480 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 190512 |
| Euler totient φ(n) | 32128 |
| Square | 6477030400 |
| Cube | 521271406592000 |
| Square root | 283.689972 (= 4√5030) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 45 |
| Scientific notation | 8.048 × |
80480 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand four hundred and eighty |
| Binary (base 2) | 10011101001100000 |
| Octal (base 8) | 235140 |
| Hexadecimal (base 16) | 13A60 |
| Base 3 | 11002101202 |
| As time | 80480 seconds = 22 h 21 min 20 s |
Is 80480 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (80480 ÷ 2 = 40240) | 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 (80480 ÷ 4 = 20120) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (80480 ÷ 5 = 16096) | 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 1) | 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 (80480 ÷ 8 = 10060) | 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 (80480 ÷ 10 = 8048) | 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 80480 a prime number?
No. 80480 = × 5 × 503, so it is divisible by 2.
What are the factors of 80480?
1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 80, 160, 503, 1006, 2012, 2515, 4024, 5030, 8048, 10060, 16096, 20120, 40240, 80480.
What is 80480 in binary?
10011101001100000 (hexadecimal 13A60, octal 235140).
What is the square root of 80480?
About 283.6900, exactly 4√5030.
Is 80480 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 80480?
80480 is a Harshad number: divisible by its digit sum 20.