The number 5680
5680 is a composite number with 20 divisors. Its prime factorisation is × 5 × 71. Divisors (20): 1, 2, 4, 5, 8, 10, 16, 20, 40, 71, 80, 142, 284, 355, 568, 710 … 5680.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5680 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5680 is composite. Its prime factorisation is
- 3
The divisors add up to 13392; without 5680 itself that is 7712, so 5680 is abundant (7712 is more than 5680). Euler's totient φ(5680) = 2240 numbers up to 5680 share no factor with it.
- 4
The digits of 5680 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 36 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5680 = 2^{4} \times 5 \times 71 \]5680 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 13392 |
| Euler totient φ(n) | 2240 |
| Square | 32262400 |
| Cube | 183250432000 |
| Square root | 75.365775 (= 4√355) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 36 |
| Scientific notation | 5.68 × |
5680 in other forms
| Form | Value |
|---|---|
| In words | five thousand six hundred and eighty |
| Binary (base 2) | 1011000110000 |
| Octal (base 8) | 13060 |
| Hexadecimal (base 16) | 1630 |
| Base 3 | 21210101 |
| As time | 5680 seconds = 1 h 34 min 40 s |
Is 5680 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5680 ÷ 2 = 2840) | 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 (5680 ÷ 4 = 1420) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (5680 ÷ 5 = 1136) | 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 (5680 ÷ 8 = 710) | 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 (5680 ÷ 10 = 568) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5680 a prime number?
No. 5680 = × 5 × 71, so it is divisible by 2.
What are the factors of 5680?
1, 2, 4, 5, 8, 10, 16, 20, 40, 71, 80, 142, 284, 355, 568, 710, 1136, 1420, 2840, 5680.
What is 5680 in binary?
1011000110000 (hexadecimal 1630, octal 13060).
What is the square root of 5680?
About 75.3658, exactly 4√355.
Is 5680 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 5680?
It is a composite number with 20 divisors.