The number 1136
1136 is a composite number with 10 divisors. Its prime factorisation is × 71. Divisors (10): 1, 2, 4, 8, 16, 71, 142, 284, 568, 1136.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1136 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1136 is composite. Its prime factorisation is
- 3
The divisors add up to 2232; without 1136 itself that is 1096, so 1136 is deficient (1096 is less than 1136). Euler's totient φ(1136) = 560 numbers up to 1136 share no factor with it.
- 4
The digits of 1136 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 106 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1136 = 2^{4} \times 71 \]1136 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 2232 |
| Euler totient φ(n) | 560 |
| Square | 1290496 |
| Cube | 1466003456 |
| Square root | 33.704599 (= 4√71) |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 106 |
| Scientific notation | 1.136 × |
1136 in other forms
| Form | Value |
|---|---|
| In words | one thousand one hundred and thirty-six |
| Roman numerals | MCXXXVI |
| Binary (base 2) | 10001110000 |
| Octal (base 8) | 2160 |
| Hexadecimal (base 16) | 470 |
| Base 3 | 1120002 |
| As time | 1136 seconds = 18 min 56 s |
Is 1136 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1136 ÷ 2 = 568) | 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 | Yes (1136 ÷ 4 = 284) | 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 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 (1136 ÷ 8 = 142) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1136 a prime number?
No. 1136 = × 71, so it is divisible by 2.
What are the factors of 1136?
1, 2, 4, 8, 16, 71, 142, 284, 568, 1136.
What is 1136 in binary?
10001110000 (hexadecimal 470, octal 2160).
What is the square root of 1136?
About 33.7046, exactly 4√71.
What is 1136 in Roman numerals?
MCXXXVI.
Is 1136 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 1136?
It is a composite number with 10 divisors.