The number 11560
11560 is a composite number with 24 divisors. Its prime factorisation is × 5 × . Divisors (24): 1, 2, 4, 5, 8, 10, 17, 20, 34, 40, 68, 85, 136, 170, 289, 340 … 11560.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11560 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11560 is composite. Its prime factorisation is
- 3
The divisors add up to 27630; without 11560 itself that is 16070, so 11560 is abundant (16070 is more than 11560). Euler's totient φ(11560) = 4352 numbers up to 11560 share no factor with it.
- 4
The digits of 11560 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11560 = 2^{3} \times 5 \times 17^{2} \]11560 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 27630 |
| Euler totient φ(n) | 4352 |
| Square | 133633600 |
| Cube | 1544804416000 |
| Square root | 107.517440 (= 34√10) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 50 |
| Scientific notation | 1.156 × |
11560 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand five hundred and sixty |
| Binary (base 2) | 10110100101000 |
| Octal (base 8) | 26450 |
| Hexadecimal (base 16) | 2D28 |
| Base 3 | 120212011 |
| As time | 11560 seconds = 3 h 12 min 40 s |
Is 11560 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11560 ÷ 2 = 5780) | 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 (11560 ÷ 4 = 2890) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (11560 ÷ 5 = 2312) | 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 (11560 ÷ 8 = 1445) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (11560 ÷ 10 = 1156) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 11560 a prime number?
No. 11560 = × 5 × , so it is divisible by 2.
What are the factors of 11560?
1, 2, 4, 5, 8, 10, 17, 20, 34, 40, 68, 85, 136, 170, 289, 340, 578, 680, 1156, 1445, 2312, 2890, 5780, 11560.
What is 11560 in binary?
10110100101000 (hexadecimal 2D28, octal 26450).
What is the square root of 11560?
About 107.5174, exactly 34√10.
Is 11560 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 11560?
It is a composite number with 24 divisors.