The number 16560
16560 is a composite number with 60 divisors. Its prime factorisation is × × 5 × 23. Divisors (60): 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 16, 18, 20, 23, 24 … 16560.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16560: a Harshad number: divisible by its digit sum 18.
- 2
16560 is composite. Its prime factorisation is
- 3
The divisors add up to 58032; without 16560 itself that is 41472, so 16560 is abundant (41472 is more than 16560). Euler's totient φ(16560) = 4224 numbers up to 16560 share no factor with it.
- 4
The digits of 16560 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 128 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16560 = 2^{4} \times 3^{2} \times 5 \times 23 \]16560 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 60 |
| Sum of divisors | 58032 |
| Euler totient φ(n) | 4224 |
| Square | 274233600 |
| Cube | 4541308416000 |
| Square root | 128.685664 (= 12√115) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 128 |
| Scientific notation | 1.656 × |
16560 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand five hundred and sixty |
| Binary (base 2) | 100000010110000 |
| Octal (base 8) | 40260 |
| Hexadecimal (base 16) | 40B0 |
| Base 3 | 211201100 |
| As time | 16560 seconds = 4 h 36 min 0 s |
Is 16560 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16560 ÷ 2 = 8280) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (16560 ÷ 3 = 5520) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (16560 ÷ 4 = 4140) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (16560 ÷ 5 = 3312) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (16560 ÷ 6 = 2760) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 (16560 ÷ 8 = 2070) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (16560 ÷ 9 = 1840) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (16560 ÷ 10 = 1656) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (16560 ÷ 12 = 1380) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16560 a prime number?
No. 16560 = × × 5 × 23, so it is divisible by 2.
What are the factors of 16560?
1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 16, 18, 20, 23, 24, 30, 36, 40, 45, 46, 48, 60, 69, 72, 80, 90, 92, 115, 120, 138, 144, 180, 184, 207, 230, 240, 276, 345, 360, 368, 414, 460, 552, 690, 720, 828, 920, 1035, 1104, 1380, 1656, 1840, 2070, 2760, 3312, 4140, 5520, 8280, 16560.
What is 16560 in binary?
100000010110000 (hexadecimal 40B0, octal 40260).
What is the square root of 16560?
About 128.6857, exactly 12√115.
Is 16560 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 16560?
16560 is a Harshad number: divisible by its digit sum 18.