The number 1560
1560 is a composite number with 32 divisors. Its prime factorisation is × 3 × 5 × 13. Divisors (32): 1, 2, 3, 4, 5, 6, 8, 10, 12, 13, 15, 20, 24, 26, 30, 39 … 1560.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1560: a Harshad number: divisible by its digit sum 12.
- 2
1560 is composite. Its prime factorisation is
- 3
The divisors add up to 5040; without 1560 itself that is 3480, so 1560 is abundant (3480 is more than 1560). Euler's totient φ(1560) = 384 numbers up to 1560 share no factor with it.
- 4
The digits of 1560 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 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1560 = 2^{3} \times 3 \times 5 \times 13 \]1560 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 5040 |
| Euler totient φ(n) | 384 |
| Square | 2433600 |
| Cube | 3796416000 |
| Square root | 39.496835 (= 2√390) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 122 |
| Scientific notation | 1.56 × |
1560 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and sixty |
| Roman numerals | MDLX |
| Binary (base 2) | 11000011000 |
| Octal (base 8) | 3030 |
| Hexadecimal (base 16) | 618 |
| Base 3 | 2010210 |
| As time | 1560 seconds = 26 min 0 s |
Is 1560 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1560 ÷ 2 = 780) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (1560 ÷ 3 = 520) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (1560 ÷ 4 = 390) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (1560 ÷ 5 = 312) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (1560 ÷ 6 = 260) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 (1560 ÷ 8 = 195) | 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 (1560 ÷ 10 = 156) | 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 | Yes (1560 ÷ 12 = 130) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1560 a prime number?
No. 1560 = × 3 × 5 × 13, so it is divisible by 2.
What are the factors of 1560?
1, 2, 3, 4, 5, 6, 8, 10, 12, 13, 15, 20, 24, 26, 30, 39, 40, 52, 60, 65, 78, 104, 120, 130, 156, 195, 260, 312, 390, 520, 780, 1560.
What is 1560 in binary?
11000011000 (hexadecimal 618, octal 3030).
What is the square root of 1560?
About 39.4968, exactly 2√390.
What is 1560 in Roman numerals?
MDLX.
Is 1560 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 1560?
1560 is a Harshad number: divisible by its digit sum 12.