The number 1163
1163 is the 192nd prime number. Its only divisors are 1 and 1163.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1163: the 192nd prime number.
- 2
1163 is prime, so its only factors are 1 and 1163. It is the 192nd prime; the next prime is 1171 and the one before is 1153.
- 3
The divisors add up to 1164; without 1163 itself that is 1, so 1163 is deficient (1 is less than 1163). Euler's totient φ(1163) = 1162 numbers up to 1163 share no factor with it.
- 4
The digits of 1163 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 150 steps to reach 1.
1163 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 1164 |
| Euler totient φ(n) | 1162 |
| Square | 1352569 |
| Cube | 1573037747 |
| Square root | 34.102786 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 150 |
| Scientific notation | 1.163 × |
1163 in other forms
| Form | Value |
|---|---|
| In words | one thousand one hundred and sixty-three |
| Roman numerals | MCLXIII |
| Binary (base 2) | 10010001011 |
| Octal (base 8) | 2213 |
| Hexadecimal (base 16) | 48B |
| Base 3 | 1121002 |
| As time | 1163 seconds = 19 min 23 s |
Is 1163 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 3) | 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 3) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1163 a prime number?
Yes. 1163 is divisible only by 1 and itself.
What are the factors of 1163?
1, 1163.
What is 1163 in binary?
10010001011 (hexadecimal 48B, octal 2213).
What is the square root of 1163?
About 34.1028.
What is 1163 in Roman numerals?
MCLXIII.
Is 1163 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 1163?
1163 is the 192nd prime number.