The number 15560
15560 is a composite number with 16 divisors. Its prime factorisation is × 5 × 389. Divisors (16): 1, 2, 4, 5, 8, 10, 20, 40, 389, 778, 1556, 1945, 3112, 3890, 7780, 15560.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15560 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15560 is composite. Its prime factorisation is
- 3
The divisors add up to 35100; without 15560 itself that is 19540, so 15560 is abundant (19540 is more than 15560). Euler's totient φ(15560) = 6208 numbers up to 15560 share no factor with it.
- 4
The digits of 15560 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15560 = 2^{3} \times 5 \times 389 \]15560 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 35100 |
| Euler totient φ(n) | 6208 |
| Square | 242113600 |
| Cube | 3767287616000 |
| Square root | 124.739729 (= 2√3890) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.556 × |
15560 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand five hundred and sixty |
| Binary (base 2) | 11110011001000 |
| Octal (base 8) | 36310 |
| Hexadecimal (base 16) | 3CC8 |
| Base 3 | 210100022 |
| As time | 15560 seconds = 4 h 19 min 20 s |
Is 15560 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15560 ÷ 2 = 7780) | 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 (15560 ÷ 4 = 3890) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (15560 ÷ 5 = 3112) | 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 | 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 (15560 ÷ 8 = 1945) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (15560 ÷ 10 = 1556) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 15560 a prime number?
No. 15560 = × 5 × 389, so it is divisible by 2.
What are the factors of 15560?
1, 2, 4, 5, 8, 10, 20, 40, 389, 778, 1556, 1945, 3112, 3890, 7780, 15560.
What is 15560 in binary?
11110011001000 (hexadecimal 3CC8, octal 36310).
What is the square root of 15560?
About 124.7397, exactly 2√3890.
Is 15560 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 15560?
It is a composite number with 16 divisors.