The number 10159
10159 is the 1247th prime number. Its only divisors are 1 and 10159.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10159: the 1247th prime number.
- 2
10159 is prime, so its only factors are 1 and 10159. It is the 1247th prime; the next prime is 10163 and the one before is 10151.
- 3
The divisors add up to 10160; without 10159 itself that is 1, so 10159 is deficient (1 is less than 10159). Euler's totient φ(10159) = 10158 numbers up to 10159 share no factor with it.
- 4
The digits of 10159 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 179 steps to reach 1.
10159 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 10160 |
| Euler totient φ(n) | 10158 |
| Square | 103205281 |
| Cube | 1048462449679 |
| Square root | 100.791865 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 179 |
| Scientific notation | 1.0159 × |
10159 in other forms
| Form | Value |
|---|---|
| In words | ten thousand one hundred and fifty-nine |
| Binary (base 2) | 10011110101111 |
| Octal (base 8) | 23657 |
| Hexadecimal (base 16) | 27AF |
| Base 3 | 111221021 |
| As time | 10159 seconds = 2 h 49 min 19 s |
Is 10159 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 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 1) | 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 | No (remainder 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10159 a prime number?
Yes. 10159 is divisible only by 1 and itself.
What are the factors of 10159?
1, 10159.
What is 10159 in binary?
10011110101111 (hexadecimal 27AF, octal 23657).
What is the square root of 10159?
About 100.7919.
Is 10159 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 10159?
10159 is the 1247th prime number.