The number 11136
11136 is a composite number with 32 divisors. Its prime factorisation is × 3 × 29. Divisors (32): 1, 2, 3, 4, 6, 8, 12, 16, 24, 29, 32, 48, 58, 64, 87, 96 … 11136.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11136: a Harshad number: divisible by its digit sum 12.
- 2
11136 is composite. Its prime factorisation is
- 3
The divisors add up to 30600; without 11136 itself that is 19464, so 11136 is abundant (19464 is more than 11136). Euler's totient φ(11136) = 3584 numbers up to 11136 share no factor with it.
- 4
The digits of 11136 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 37 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11136 = 2^{7} \times 3 \times 29 \]11136 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 30600 |
| Euler totient φ(n) | 3584 |
| Square | 124010496 |
| Cube | 1380980883456 |
| Square root | 105.527248 (= 8√174) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 37 |
| Scientific notation | 1.1136 × |
11136 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand one hundred and thirty-six |
| Binary (base 2) | 10101110000000 |
| Octal (base 8) | 25600 |
| Hexadecimal (base 16) | 2B80 |
| Base 3 | 120021110 |
| As time | 11136 seconds = 3 h 5 min 36 s |
Is 11136 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11136 ÷ 2 = 5568) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (11136 ÷ 3 = 3712) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (11136 ÷ 4 = 2784) | 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 (11136 ÷ 6 = 1856) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 | Yes (11136 ÷ 8 = 1392) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (11136 ÷ 12 = 928) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11136 a prime number?
No. 11136 = × 3 × 29, so it is divisible by 2.
What are the factors of 11136?
1, 2, 3, 4, 6, 8, 12, 16, 24, 29, 32, 48, 58, 64, 87, 96, 116, 128, 174, 192, 232, 348, 384, 464, 696, 928, 1392, 1856, 2784, 3712, 5568, 11136.
What is 11136 in binary?
10101110000000 (hexadecimal 2B80, octal 25600).
What is the square root of 11136?
About 105.5272, exactly 8√174.
Is 11136 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 11136?
11136 is a Harshad number: divisible by its digit sum 12.