The number 13560
13560 is a composite number with 32 divisors. Its prime factorisation is × 3 × 5 × 113. Divisors (32): 1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 24, 30, 40, 60, 113 … 13560.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13560: a Harshad number: divisible by its digit sum 15.
- 2
13560 is composite. Its prime factorisation is
- 3
The divisors add up to 41040; without 13560 itself that is 27480, so 13560 is abundant (27480 is more than 13560). Euler's totient φ(13560) = 3584 numbers up to 13560 share no factor with it.
- 4
The digits of 13560 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 182 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13560 = 2^{3} \times 3 \times 5 \times 113 \]13560 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 41040 |
| Euler totient φ(n) | 3584 |
| Square | 183873600 |
| Cube | 2493326016000 |
| Square root | 116.447413 (= 2√3390) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 182 |
| Scientific notation | 1.356 × |
13560 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand five hundred and sixty |
| Binary (base 2) | 11010011111000 |
| Octal (base 8) | 32370 |
| Hexadecimal (base 16) | 34F8 |
| Base 3 | 200121020 |
| As time | 13560 seconds = 3 h 46 min 0 s |
Is 13560 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13560 ÷ 2 = 6780) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (13560 ÷ 3 = 4520) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (13560 ÷ 4 = 3390) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (13560 ÷ 5 = 2712) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (13560 ÷ 6 = 2260) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 (13560 ÷ 8 = 1695) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (13560 ÷ 10 = 1356) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (13560 ÷ 12 = 1130) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13560 a prime number?
No. 13560 = × 3 × 5 × 113, so it is divisible by 2.
What are the factors of 13560?
1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 24, 30, 40, 60, 113, 120, 226, 339, 452, 565, 678, 904, 1130, 1356, 1695, 2260, 2712, 3390, 4520, 6780, 13560.
What is 13560 in binary?
11010011111000 (hexadecimal 34F8, octal 32370).
What is the square root of 13560?
About 116.4474, exactly 2√3390.
Is 13560 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 13560?
13560 is a Harshad number: divisible by its digit sum 15.