The number 15566
15566 is a composite number with 8 divisors. Its prime factorisation is 2 × 43 × 181. Divisors (8): 1, 2, 43, 86, 181, 362, 7783, 15566.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15566 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15566 is composite. Its prime factorisation is
- 3
The divisors add up to 24024; without 15566 itself that is 8458, so 15566 is deficient (8458 is less than 15566). Euler's totient φ(15566) = 7560 numbers up to 15566 share no factor with it.
- 4
The digits of 15566 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15566 = 2 \times 43 \times 181 \]
15566 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 24024 |
| Euler totient φ(n) | 7560 |
| Square | 242300356 |
| Cube | 3771647341496 |
| Square root | 124.763777 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.5566 × |
15566 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand five hundred and sixty-six |
| Binary (base 2) | 11110011001110 |
| Octal (base 8) | 36316 |
| Hexadecimal (base 16) | 3CCE |
| Base 3 | 210100112 |
| As time | 15566 seconds = 4 h 19 min 26 s |
Is 15566 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15566 ÷ 2 = 7783) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 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 | No (remainder 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15566 a prime number?
No. 15566 = 2 × 43 × 181, so it is divisible by 2.
What are the factors of 15566?
1, 2, 43, 86, 181, 362, 7783, 15566.
What is 15566 in binary?
11110011001110 (hexadecimal 3CCE, octal 36316).
What is the square root of 15566?
About 124.7638.
Is 15566 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 15566?
It is a composite number with 8 divisors.