The number 11680
11680 is a composite number with 24 divisors. Its prime factorisation is × 5 × 73. Divisors (24): 1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 73, 80, 146, 160, 292, 365 … 11680.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11680: a Harshad number: divisible by its digit sum 16.
- 2
11680 is composite. Its prime factorisation is
- 3
The divisors add up to 27972; without 11680 itself that is 16292, so 11680 is abundant (16292 is more than 11680). Euler's totient φ(11680) = 4608 numbers up to 11680 share no factor with it.
- 4
The digits of 11680 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 99 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11680 = 2^{5} \times 5 \times 73 \]11680 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 27972 |
| Euler totient φ(n) | 4608 |
| Square | 136422400 |
| Cube | 1593413632000 |
| Square root | 108.074049 (= 4√730) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 99 |
| Scientific notation | 1.168 × |
11680 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand six hundred and eighty |
| Binary (base 2) | 10110110100000 |
| Octal (base 8) | 26640 |
| Hexadecimal (base 16) | 2DA0 |
| Base 3 | 121000121 |
| As time | 11680 seconds = 3 h 14 min 40 s |
Is 11680 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11680 ÷ 2 = 5840) | 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 (11680 ÷ 4 = 2920) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (11680 ÷ 5 = 2336) | 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 (11680 ÷ 8 = 1460) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (11680 ÷ 10 = 1168) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 11680 a prime number?
No. 11680 = × 5 × 73, so it is divisible by 2.
What are the factors of 11680?
1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 73, 80, 146, 160, 292, 365, 584, 730, 1168, 1460, 2336, 2920, 5840, 11680.
What is 11680 in binary?
10110110100000 (hexadecimal 2DA0, octal 26640).
What is the square root of 11680?
About 108.0740, exactly 4√730.
Is 11680 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 11680?
11680 is a Harshad number: divisible by its digit sum 16.