The number 13566
13566 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 7 × 17 × 19. Divisors (32): 1, 2, 3, 6, 7, 14, 17, 19, 21, 34, 38, 42, 51, 57, 102, 114 … 13566.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13566: a Harshad number: divisible by its digit sum 21.
- 2
13566 is composite. Its prime factorisation is
- 3
The divisors add up to 34560; without 13566 itself that is 20994, so 13566 is abundant (20994 is more than 13566). Euler's totient φ(13566) = 3456 numbers up to 13566 share no factor with it.
- 4
The digits of 13566 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 182 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13566 = 2 \times 3 \times 7 \times 17 \times 19 \]
13566 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 34560 |
| Euler totient φ(n) | 3456 |
| Square | 184036356 |
| Cube | 2496637205496 |
| Square root | 116.473173 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 182 |
| Scientific notation | 1.3566 × |
13566 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand five hundred and sixty-six |
| Binary (base 2) | 11010011111110 |
| Octal (base 8) | 32376 |
| Hexadecimal (base 16) | 34FE |
| Base 3 | 200121110 |
| As time | 13566 seconds = 3 h 46 min 6 s |
Is 13566 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13566 ÷ 2 = 6783) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (13566 ÷ 3 = 4522) | 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 | Yes (13566 ÷ 6 = 2261) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (13566 ÷ 7 = 1938) | 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 3) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13566 a prime number?
No. 13566 = 2 × 3 × 7 × 17 × 19, so it is divisible by 2.
What are the factors of 13566?
1, 2, 3, 6, 7, 14, 17, 19, 21, 34, 38, 42, 51, 57, 102, 114, 119, 133, 238, 266, 323, 357, 399, 646, 714, 798, 969, 1938, 2261, 4522, 6783, 13566.
What is 13566 in binary?
11010011111110 (hexadecimal 34FE, octal 32376).
What is the square root of 13566?
About 116.4732.
Is 13566 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 13566?
13566 is a Harshad number: divisible by its digit sum 21.