The number 80560
80560 is a composite number with 40 divisors. Its prime factorisation is × 5 × 19 × 53. Divisors (40): 1, 2, 4, 5, 8, 10, 16, 19, 20, 38, 40, 53, 76, 80, 95, 106 … 80560.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 80560: a Harshad number: divisible by its digit sum 19.
- 2
80560 is composite. Its prime factorisation is
- 3
The divisors add up to 200880; without 80560 itself that is 120320, so 80560 is abundant (120320 is more than 80560). Euler's totient φ(80560) = 29952 numbers up to 80560 share no factor with it.
- 4
The digits of 80560 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 138 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80560 = 2^{4} \times 5 \times 19 \times 53 \]80560 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 40 |
| Sum of divisors | 200880 |
| Euler totient φ(n) | 29952 |
| Square | 6489913600 |
| Cube | 522827439616000 |
| Square root | 283.830936 (= 4√5035) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 138 |
| Scientific notation | 8.056 × |
80560 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand five hundred and sixty |
| Binary (base 2) | 10011101010110000 |
| Octal (base 8) | 235260 |
| Hexadecimal (base 16) | 13AB0 |
| Base 3 | 11002111201 |
| As time | 80560 seconds = 22 h 22 min 40 s |
Is 80560 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (80560 ÷ 2 = 40280) | 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 (80560 ÷ 4 = 20140) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (80560 ÷ 5 = 16112) | 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 4) | 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 (80560 ÷ 8 = 10070) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (80560 ÷ 10 = 8056) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 80560 a prime number?
No. 80560 = × 5 × 19 × 53, so it is divisible by 2.
What are the factors of 80560?
1, 2, 4, 5, 8, 10, 16, 19, 20, 38, 40, 53, 76, 80, 95, 106, 152, 190, 212, 265, 304, 380, 424, 530, 760, 848, 1007, 1060, 1520, 2014, 2120, 4028, 4240, 5035, 8056, 10070, 16112, 20140, 40280, 80560.
What is 80560 in binary?
10011101010110000 (hexadecimal 13AB0, octal 235260).
What is the square root of 80560?
About 283.8309, exactly 4√5035.
Is 80560 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 80560?
80560 is a Harshad number: divisible by its digit sum 19.