The number 11161
11161 is a twin prime (11159 and 11161 are both prime) and the 1352nd prime number. Its only divisors are 1 and 11161.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11161: a twin prime (11159 and 11161 are both prime); the 1352nd prime number.
- 2
11161 is prime, so its only factors are 1 and 11161. It is the 1352nd prime; the next prime is 11171 and the one before is 11159.
- 3
The divisors add up to 11162; without 11161 itself that is 1, so 11161 is deficient (1 is less than 11161). Euler's totient φ(11161) = 11160 numbers up to 11161 share no factor with it.
- 4
The digits of 11161 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 42 steps to reach 1.
11161 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 11162 |
| Euler totient φ(n) | 11160 |
| Square | 124567921 |
| Cube | 1390302566281 |
| Square root | 105.645634 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 42 |
| Scientific notation | 1.1161 × |
11161 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand one hundred and sixty-one |
| Binary (base 2) | 10101110011001 |
| Octal (base 8) | 25631 |
| Hexadecimal (base 16) | 2B99 |
| Base 3 | 120022101 |
| As time | 11161 seconds = 3 h 6 min 1 s |
Is 11161 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 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 1) | 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 1) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11161 a prime number?
Yes. 11161 is divisible only by 1 and itself.
What are the factors of 11161?
1, 11161.
What is 11161 in binary?
10101110011001 (hexadecimal 2B99, octal 25631).
What is the square root of 11161?
About 105.6456.
Is 11161 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 11161?
11161 is a twin prime (11159 and 11161 are both prime); the 1352nd prime number.