The number 11092
11092 is a composite number with 12 divisors. Its prime factorisation is × 47 × 59. Divisors (12): 1, 2, 4, 47, 59, 94, 118, 188, 236, 2773, 5546, 11092.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11092 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11092 is composite. Its prime factorisation is
- 3
The divisors add up to 20160; without 11092 itself that is 9068, so 11092 is deficient (9068 is less than 11092). Euler's totient φ(11092) = 5336 numbers up to 11092 share no factor with it.
- 4
The digits of 11092 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 37 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11092 = 2^{2} \times 47 \times 59 \]11092 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 20160 |
| Euler totient φ(n) | 5336 |
| Square | 123032464 |
| Cube | 1364676090688 |
| Square root | 105.318564 (= 2√2773) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 37 |
| Scientific notation | 1.1092 × |
11092 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand and ninety-two |
| Binary (base 2) | 10101101010100 |
| Octal (base 8) | 25524 |
| Hexadecimal (base 16) | 2B54 |
| Base 3 | 120012211 |
| As time | 11092 seconds = 3 h 4 min 52 s |
Is 11092 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11092 ÷ 2 = 5546) | 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 | Yes (11092 ÷ 4 = 2773) | 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 4) | 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 4) | 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 | No (remainder 2) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11092 a prime number?
No. 11092 = × 47 × 59, so it is divisible by 2.
What are the factors of 11092?
1, 2, 4, 47, 59, 94, 118, 188, 236, 2773, 5546, 11092.
What is 11092 in binary?
10101101010100 (hexadecimal 2B54, octal 25524).
What is the square root of 11092?
About 105.3186, exactly 2√2773.
Is 11092 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 11092?
It is a composite number with 12 divisors.