The number 560
560 is a composite number with 20 divisors. Its prime factorisation is × 5 × 7. Divisors (20): 1, 2, 4, 5, 7, 8, 10, 14, 16, 20, 28, 35, 40, 56, 70, 80 … 560.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
560 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
560 is composite. Its prime factorisation is
- 3
The divisors add up to 1488; without 560 itself that is 928, so 560 is abundant (928 is more than 560). Euler's totient φ(560) = 192 numbers up to 560 share no factor with it.
- 4
The digits of 560 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 17 steps to reach 1.
LaTeX source of the formulas on this page
\[ 560 = 2^{4} \times 5 \times 7 \]560 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 1488 |
| Euler totient φ(n) | 192 |
| Square | 313600 |
| Cube | 175616000 |
| Square root | 23.664319 (= 4√35) |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 17 |
| Scientific notation | 5.6 × |
560 in other forms
| Form | Value |
|---|---|
| In words | five hundred and sixty |
| Roman numerals | DLX |
| Binary (base 2) | 1000110000 |
| Octal (base 8) | 1060 |
| Hexadecimal (base 16) | 230 |
| Base 3 | 202202 |
| As time | 560 seconds = 9 min 20 s |
Is 560 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (560 ÷ 2 = 280) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (560 ÷ 4 = 140) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (560 ÷ 5 = 112) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (560 ÷ 7 = 80) | 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 (560 ÷ 8 = 70) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (560 ÷ 10 = 56) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 560 a prime number?
No. 560 = × 5 × 7, so it is divisible by 2.
What are the factors of 560?
1, 2, 4, 5, 7, 8, 10, 14, 16, 20, 28, 35, 40, 56, 70, 80, 112, 140, 280, 560.
What is 560 in binary?
1000110000 (hexadecimal 230, octal 1060).
What is the square root of 560?
About 23.6643, exactly 4√35.
What is 560 in Roman numerals?
DLX.
Is 560 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 560?
It is a composite number with 20 divisors.