The number 11110
11110 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 11 × 101. Divisors (16): 1, 2, 5, 10, 11, 22, 55, 101, 110, 202, 505, 1010, 1111, 2222, 5555, 11110.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11110 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11110 is composite. Its prime factorisation is
- 3
The divisors add up to 22032; without 11110 itself that is 10922, so 11110 is deficient (10922 is less than 11110). Euler's totient φ(11110) = 4000 numbers up to 11110 share no factor with it.
- 4
The digits of 11110 add up to 4, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11110 = 2 \times 5 \times 11 \times 101 \]
11110 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 22032 |
| Euler totient φ(n) | 4000 |
| Square | 123432100 |
| Cube | 1371330631000 |
| Square root | 105.403985 |
| Digit sum / digital root | 4 / 4 |
| Collatz steps to 1 | 130 |
| Scientific notation | 1.111 × |
11110 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand one hundred and ten |
| Binary (base 2) | 10101101100110 |
| Octal (base 8) | 25546 |
| Hexadecimal (base 16) | 2B66 |
| Base 3 | 120020111 |
| As time | 11110 seconds = 3 h 5 min 10 s |
Is 11110 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11110 ÷ 2 = 5555) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 | Yes (11110 ÷ 5 = 2222) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (11110 ÷ 10 = 1111) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (11110 ÷ 11 = 1010) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11110 a prime number?
No. 11110 = 2 × 5 × 11 × 101, so it is divisible by 2.
What are the factors of 11110?
1, 2, 5, 10, 11, 22, 55, 101, 110, 202, 505, 1010, 1111, 2222, 5555, 11110.
What is 11110 in binary?
10101101100110 (hexadecimal 2B66, octal 25546).
What is the square root of 11110?
About 105.4040.
Is 11110 divisible by 3?
No. Its digits add up to 4, which is not a multiple of 3.
What is special about the number 11110?
It is a composite number with 16 divisors.