The number 1166
1166 is a composite number with 8 divisors. Its prime factorisation is 2 × 11 × 53. Divisors (8): 1, 2, 11, 22, 53, 106, 583, 1166.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1166 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1166 is composite. Its prime factorisation is
- 3
The divisors add up to 1944; without 1166 itself that is 778, so 1166 is deficient (778 is less than 1166). Euler's totient φ(1166) = 520 numbers up to 1166 share no factor with it.
- 4
The digits of 1166 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 31 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1166 = 2 \times 11 \times 53 \]
1166 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 1944 |
| Euler totient φ(n) | 520 |
| Square | 1359556 |
| Cube | 1585242296 |
| Square root | 34.146742 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 31 |
| Scientific notation | 1.166 × |
1166 in other forms
| Form | Value |
|---|---|
| In words | one thousand one hundred and sixty-six |
| Roman numerals | MCLXVI |
| Binary (base 2) | 10010001110 |
| Octal (base 8) | 2216 |
| Hexadecimal (base 16) | 48E |
| Base 3 | 1121012 |
| As time | 1166 seconds = 19 min 26 s |
Is 1166 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1166 ÷ 2 = 583) | 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 4) | 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 | Yes (1166 ÷ 11 = 106) | 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 1166 a prime number?
No. 1166 = 2 × 11 × 53, so it is divisible by 2.
What are the factors of 1166?
1, 2, 11, 22, 53, 106, 583, 1166.
What is 1166 in binary?
10010001110 (hexadecimal 48E, octal 2216).
What is the square root of 1166?
About 34.1467.
What is 1166 in Roman numerals?
MCLXVI.
Is 1166 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 1166?
It is a composite number with 8 divisors.