The number 1162
1162 is a composite number with 8 divisors. Its prime factorisation is 2 × 7 × 83. Divisors (8): 1, 2, 7, 14, 83, 166, 581, 1162.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1162 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1162 is composite. Its prime factorisation is
- 3
The divisors add up to 2016; without 1162 itself that is 854, so 1162 is deficient (854 is less than 1162). Euler's totient φ(1162) = 492 numbers up to 1162 share no factor with it.
- 4
The digits of 1162 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 119 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1162 = 2 \times 7 \times 83 \]
1162 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 2016 |
| Euler totient φ(n) | 492 |
| Square | 1350244 |
| Cube | 1568983528 |
| Square root | 34.088121 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 119 |
| Scientific notation | 1.162 × |
1162 in other forms
| Form | Value |
|---|---|
| In words | one thousand one hundred and sixty-two |
| Roman numerals | MCLXII |
| Binary (base 2) | 10010001010 |
| Octal (base 8) | 2212 |
| Hexadecimal (base 16) | 48A |
| Base 3 | 1121001 |
| As time | 1162 seconds = 19 min 22 s |
Is 1162 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1162 ÷ 2 = 581) | 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 | 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 | Yes (1162 ÷ 7 = 166) | 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 1) | 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 7) | 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 1162 a prime number?
No. 1162 = 2 × 7 × 83, so it is divisible by 2.
What are the factors of 1162?
1, 2, 7, 14, 83, 166, 581, 1162.
What is 1162 in binary?
10010001010 (hexadecimal 48A, octal 2212).
What is the square root of 1162?
About 34.0881.
What is 1162 in Roman numerals?
MCLXII.
Is 1162 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 1162?
It is a composite number with 8 divisors.