The number 11166
11166 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 1861. Divisors (8): 1, 2, 3, 6, 1861, 3722, 5583, 11166.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11166 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11166 is composite. Its prime factorisation is
- 3
The divisors add up to 22344; without 11166 itself that is 11178, so 11166 is abundant (11178 is more than 11166). Euler's totient φ(11166) = 3720 numbers up to 11166 share no factor with it.
- 4
The digits of 11166 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11166 = 2 \times 3 \times 1861 \]
11166 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 22344 |
| Euler totient φ(n) | 3720 |
| Square | 124679556 |
| Cube | 1392171922296 |
| Square root | 105.669295 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 68 |
| Scientific notation | 1.1166 × |
11166 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand one hundred and sixty-six |
| Binary (base 2) | 10101110011110 |
| Octal (base 8) | 25636 |
| Hexadecimal (base 16) | 2B9E |
| Base 3 | 120022120 |
| As time | 11166 seconds = 3 h 6 min 6 s |
Is 11166 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11166 ÷ 2 = 5583) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (11166 ÷ 3 = 3722) | 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 (11166 ÷ 6 = 1861) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 6) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11166 a prime number?
No. 11166 = 2 × 3 × 1861, so it is divisible by 2.
What are the factors of 11166?
1, 2, 3, 6, 1861, 3722, 5583, 11166.
What is 11166 in binary?
10101110011110 (hexadecimal 2B9E, octal 25636).
What is the square root of 11166?
About 105.6693.
Is 11166 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 11166?
It is a composite number with 8 divisors.