The number 80460
80460 is a composite number with 48 divisors. Its prime factorisation is × × 5 × 149. Divisors (48): 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 45 … 80460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 80460: a Harshad number: divisible by its digit sum 18.
- 2
80460 is composite. Its prime factorisation is
- 3
The divisors add up to 252000; without 80460 itself that is 171540, so 80460 is abundant (171540 is more than 80460). Euler's totient φ(80460) = 21312 numbers up to 80460 share no factor with it.
- 4
The digits of 80460 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 120 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80460 = 2^{2} \times 3^{3} \times 5 \times 149 \]80460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 252000 |
| Euler totient φ(n) | 21312 |
| Square | 6473811600 |
| Cube | 520882881336000 |
| Square root | 283.654720 (= 6√2235) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 120 |
| Scientific notation | 8.046 × |
80460 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand four hundred and sixty |
| Binary (base 2) | 10011101001001100 |
| Octal (base 8) | 235114 |
| Hexadecimal (base 16) | 13A4C |
| Base 3 | 11002101000 |
| As time | 80460 seconds = 22 h 21 min 0 s |
Is 80460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (80460 ÷ 2 = 40230) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (80460 ÷ 3 = 26820) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (80460 ÷ 4 = 20115) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (80460 ÷ 5 = 16092) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (80460 ÷ 6 = 13410) | 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (80460 ÷ 9 = 8940) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (80460 ÷ 10 = 8046) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (80460 ÷ 12 = 6705) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 80460 a prime number?
No. 80460 = × × 5 × 149, so it is divisible by 2.
What are the factors of 80460?
1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 45, 54, 60, 90, 108, 135, 149, 180, 270, 298, 447, 540, 596, 745, 894, 1341, 1490, 1788, 2235, 2682, 2980, 4023, 4470, 5364, 6705, 8046, 8940, 13410, 16092, 20115, 26820, 40230, 80460.
What is 80460 in binary?
10011101001001100 (hexadecimal 13A4C, octal 235114).
What is the square root of 80460?
About 283.6547, exactly 6√2235.
Is 80460 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 80460?
80460 is a Harshad number: divisible by its digit sum 18.