The number 56080
56080 is a composite number with 20 divisors. Its prime factorisation is × 5 × 701. Divisors (20): 1, 2, 4, 5, 8, 10, 16, 20, 40, 80, 701, 1402, 2804, 3505, 5608, 7010 … 56080.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56080 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56080 is composite. Its prime factorisation is
- 3
The divisors add up to 130572; without 56080 itself that is 74492, so 56080 is abundant (74492 is more than 56080). Euler's totient φ(56080) = 22400 numbers up to 56080 share no factor with it.
- 4
The digits of 56080 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 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56080 = 2^{4} \times 5 \times 701 \]56080 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 130572 |
| Euler totient φ(n) | 22400 |
| Square | 3144966400 |
| Cube | 176369715712000 |
| Square root | 236.812162 (= 4√3505) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.608 × |
56080 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and eighty |
| Binary (base 2) | 1101101100010000 |
| Octal (base 8) | 155420 |
| Hexadecimal (base 16) | DB10 |
| Base 3 | 2211221001 |
| As time | 56080 seconds = 15 h 34 min 40 s |
Is 56080 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56080 ÷ 2 = 28040) | 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 (56080 ÷ 4 = 14020) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (56080 ÷ 5 = 11216) | 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 (56080 ÷ 8 = 7010) | 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 (56080 ÷ 10 = 5608) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 56080 a prime number?
No. 56080 = × 5 × 701, so it is divisible by 2.
What are the factors of 56080?
1, 2, 4, 5, 8, 10, 16, 20, 40, 80, 701, 1402, 2804, 3505, 5608, 7010, 11216, 14020, 28040, 56080.
What is 56080 in binary?
1101101100010000 (hexadecimal DB10, octal 155420).
What is the square root of 56080?
About 236.8122, exactly 4√3505.
Is 56080 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 56080?
It is a composite number with 20 divisors.