The number 11159
11159 is a twin prime (11159 and 11161 are both prime) and the 1351st prime number. Its only divisors are 1 and 11159.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11159: a twin prime (11159 and 11161 are both prime); the 1351st prime number; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
11159 is prime, so its only factors are 1 and 11159. It is the 1351st prime; the next prime is 11161 and the one before is 11149.
- 3
The divisors add up to 11160; without 11159 itself that is 1, so 11159 is deficient (1 is less than 11159). Euler's totient φ(11159) = 11158 numbers up to 11159 share no factor with it.
- 4
The digits of 11159 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 42 steps to reach 1.
11159 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 11160 |
| Euler totient φ(n) | 11158 |
| Square | 124523281 |
| Cube | 1389555292679 |
| Square root | 105.636168 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 42 |
| Scientific notation | 1.1159 × |
11159 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand one hundred and fifty-nine |
| Binary (base 2) | 10101110010111 |
| Octal (base 8) | 25627 |
| Hexadecimal (base 16) | 2B97 |
| Base 3 | 120022022 |
| As time | 11159 seconds = 3 h 5 min 59 s |
Is 11159 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 4) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 11159 a prime number?
Yes. 11159 is divisible only by 1 and itself.
What are the factors of 11159?
1, 11159.
What is 11159 in binary?
10101110010111 (hexadecimal 2B97, octal 25627).
What is the square root of 11159?
About 105.6362.
Is 11159 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 11159?
11159 is a twin prime (11159 and 11161 are both prime); the 1351st prime number; a happy number: repeatedly adding the squares of its digits reaches 1.