The number 15564
15564 is a composite number with 12 divisors. Its prime factorisation is × 3 × 1297. Divisors (12): 1, 2, 3, 4, 6, 12, 1297, 2594, 3891, 5188, 7782, 15564.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15564: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
15564 is composite. Its prime factorisation is
- 3
The divisors add up to 36344; without 15564 itself that is 20780, so 15564 is abundant (20780 is more than 15564). Euler's totient φ(15564) = 5184 numbers up to 15564 share no factor with it.
- 4
The digits of 15564 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15564 = 2^{2} \times 3 \times 1297 \]15564 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 36344 |
| Euler totient φ(n) | 5184 |
| Square | 242238096 |
| Cube | 3770193726144 |
| Square root | 124.755761 (= 2√3891) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.5564 × |
15564 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand five hundred and sixty-four |
| Binary (base 2) | 11110011001100 |
| Octal (base 8) | 36314 |
| Hexadecimal (base 16) | 3CCC |
| Base 3 | 210100110 |
| As time | 15564 seconds = 4 h 19 min 24 s |
Is 15564 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15564 ÷ 2 = 7782) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (15564 ÷ 3 = 5188) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (15564 ÷ 4 = 3891) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (15564 ÷ 6 = 2594) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 4) | 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 | No (remainder 4) | 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 | Yes (15564 ÷ 12 = 1297) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15564 a prime number?
No. 15564 = × 3 × 1297, so it is divisible by 2.
What are the factors of 15564?
1, 2, 3, 4, 6, 12, 1297, 2594, 3891, 5188, 7782, 15564.
What is 15564 in binary?
11110011001100 (hexadecimal 3CCC, octal 36314).
What is the square root of 15564?
About 124.7558, exactly 2√3891.
Is 15564 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 15564?
15564 is a happy number: repeatedly adding the squares of its digits reaches 1.