The number 1566
1566 is a composite number with 16 divisors. Its prime factorisation is 2 × × 29. Divisors (16): 1, 2, 3, 6, 9, 18, 27, 29, 54, 58, 87, 174, 261, 522, 783, 1566.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1566: a Harshad number: divisible by its digit sum 18.
- 2
1566 is composite. Its prime factorisation is
- 3
The divisors add up to 3600; without 1566 itself that is 2034, so 1566 is abundant (2034 is more than 1566). Euler's totient φ(1566) = 504 numbers up to 1566 share no factor with it.
- 4
The digits of 1566 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1566 = 2 \times 3^{3} \times 29 \]1566 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 3600 |
| Euler totient φ(n) | 504 |
| Square | 2452356 |
| Cube | 3840389496 |
| Square root | 39.572718 (= 3√174) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 122 |
| Scientific notation | 1.566 × |
1566 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and sixty-six |
| Roman numerals | MDLXVI |
| Binary (base 2) | 11000011110 |
| Octal (base 8) | 3036 |
| Hexadecimal (base 16) | 61E |
| Base 3 | 2011000 |
| As time | 1566 seconds = 26 min 6 s |
Is 1566 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1566 ÷ 2 = 783) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (1566 ÷ 3 = 522) | 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 (1566 ÷ 6 = 261) | 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 | Yes (1566 ÷ 9 = 174) | 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 4) | 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 1566 a prime number?
No. 1566 = 2 × × 29, so it is divisible by 2.
What are the factors of 1566?
1, 2, 3, 6, 9, 18, 27, 29, 54, 58, 87, 174, 261, 522, 783, 1566.
What is 1566 in binary?
11000011110 (hexadecimal 61E, octal 3036).
What is the square root of 1566?
About 39.5727, exactly 3√174.
What is 1566 in Roman numerals?
MDLXVI.
Is 1566 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 1566?
1566 is a Harshad number: divisible by its digit sum 18.