The number 13159
13159 is the 1565th prime number. Its only divisors are 1 and 13159.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13159: the 1565th prime number.
- 2
13159 is prime, so its only factors are 1 and 13159. It is the 1565th prime; the next prime is 13163 and the one before is 13151.
- 3
The divisors add up to 13160; without 13159 itself that is 1, so 13159 is deficient (1 is less than 13159). Euler's totient φ(13159) = 13158 numbers up to 13159 share no factor with it.
- 4
The digits of 13159 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 213 steps to reach 1.
13159 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 13160 |
| Euler totient φ(n) | 13158 |
| Square | 173159281 |
| Cube | 2278602978679 |
| Square root | 114.712685 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 213 |
| Scientific notation | 1.3159 × |
13159 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand one hundred and fifty-nine |
| Binary (base 2) | 11001101100111 |
| Octal (base 8) | 31547 |
| Hexadecimal (base 16) | 3367 |
| Base 3 | 200001101 |
| As time | 13159 seconds = 3 h 39 min 19 s |
Is 13159 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 6) | 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 1) | 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 3) | 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 13159 a prime number?
Yes. 13159 is divisible only by 1 and itself.
What are the factors of 13159?
1, 13159.
What is 13159 in binary?
11001101100111 (hexadecimal 3367, octal 31547).
What is the square root of 13159?
About 114.7127.
Is 13159 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 13159?
13159 is the 1565th prime number.