The number 10560
10560 is a composite number with 56 divisors. Its prime factorisation is × 3 × 5 × 11. Divisors (56): 1, 2, 3, 4, 5, 6, 8, 10, 11, 12, 15, 16, 20, 22, 24, 30 … 10560.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10560: a Harshad number: divisible by its digit sum 12.
- 2
10560 is composite. Its prime factorisation is
- 3
The divisors add up to 36576; without 10560 itself that is 26016, so 10560 is abundant (26016 is more than 10560). Euler's totient φ(10560) = 2560 numbers up to 10560 share no factor with it.
- 4
The digits of 10560 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 117 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10560 = 2^{6} \times 3 \times 5 \times 11 \]10560 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 56 |
| Sum of divisors | 36576 |
| Euler totient φ(n) | 2560 |
| Square | 111513600 |
| Cube | 1177583616000 |
| Square root | 102.761861 (= 8√165) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 117 |
| Scientific notation | 1.056 × |
10560 in other forms
| Form | Value |
|---|---|
| In words | ten thousand five hundred and sixty |
| Binary (base 2) | 10100101000000 |
| Octal (base 8) | 24500 |
| Hexadecimal (base 16) | 2940 |
| Base 3 | 112111010 |
| As time | 10560 seconds = 2 h 56 min 0 s |
Is 10560 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10560 ÷ 2 = 5280) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (10560 ÷ 3 = 3520) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (10560 ÷ 4 = 2640) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (10560 ÷ 5 = 2112) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (10560 ÷ 6 = 1760) | 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 (10560 ÷ 8 = 1320) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (10560 ÷ 10 = 1056) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (10560 ÷ 11 = 960) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (10560 ÷ 12 = 880) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10560 a prime number?
No. 10560 = × 3 × 5 × 11, so it is divisible by 2.
What are the factors of 10560?
1, 2, 3, 4, 5, 6, 8, 10, 11, 12, 15, 16, 20, 22, 24, 30, 32, 33, 40, 44, 48, 55, 60, 64, 66, 80, 88, 96, 110, 120, 132, 160, 165, 176, 192, 220, 240, 264, 320, 330, 352, 440, 480, 528, 660, 704, 880, 960, 1056, 1320, 1760, 2112, 2640, 3520, 5280, 10560.
What is 10560 in binary?
10100101000000 (hexadecimal 2940, octal 24500).
What is the square root of 10560?
About 102.7619, exactly 8√165.
Is 10560 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 10560?
10560 is a Harshad number: divisible by its digit sum 12.