The number 11162
11162 is a composite number with 4 divisors. Its prime factorisation is 2 × 5581. Divisors (4): 1, 2, 5581, 11162.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11162: a semiprime: 2 × 5581, the product of two primes.
- 2
11162 is composite. Its prime factorisation is
- 3
The divisors add up to 16746; without 11162 itself that is 5584, so 11162 is deficient (5584 is less than 11162). Euler's totient φ(11162) = 5580 numbers up to 11162 share no factor with it.
- 4
The digits of 11162 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11162 = 2 \times 5581 \]
11162 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16746 |
| Euler totient φ(n) | 5580 |
| Square | 124590244 |
| Cube | 1390676303528 |
| Square root | 105.650367 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 130 |
| Scientific notation | 1.1162 × |
11162 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand one hundred and sixty-two |
| Binary (base 2) | 10101110011010 |
| Octal (base 8) | 25632 |
| Hexadecimal (base 16) | 2B9A |
| Base 3 | 120022102 |
| As time | 11162 seconds = 3 h 6 min 2 s |
Is 11162 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11162 ÷ 2 = 5581) | 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 2) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 11162 a prime number?
No. 11162 = 2 × 5581, so it is divisible by 2.
What are the factors of 11162?
1, 2, 5581, 11162.
What is 11162 in binary?
10101110011010 (hexadecimal 2B9A, octal 25632).
What is the square root of 11162?
About 105.6504.
Is 11162 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 11162?
11162 is a semiprime: 2 × 5581, the product of two primes.