The number 14159
14159 is the 1667th prime number. Its only divisors are 1 and 14159.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14159: the 1667th prime number.
- 2
14159 is prime, so its only factors are 1 and 14159. It is the 1667th prime; the next prime is 14173 and the one before is 14153.
- 3
The divisors add up to 14160; without 14159 itself that is 1, so 14159 is deficient (1 is less than 14159). Euler's totient φ(14159) = 14158 numbers up to 14159 share no factor with it.
- 4
The digits of 14159 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 102 steps to reach 1.
14159 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 14160 |
| Euler totient φ(n) | 14158 |
| Square | 200477281 |
| Cube | 2838557821679 |
| Square root | 118.991596 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 102 |
| Scientific notation | 1.4159 × |
14159 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand one hundred and fifty-nine |
| Binary (base 2) | 11011101001111 |
| Octal (base 8) | 33517 |
| Hexadecimal (base 16) | 374F |
| Base 3 | 201102102 |
| As time | 14159 seconds = 3 h 55 min 59 s |
Is 14159 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 5) | 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 2) | 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 2) | 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 14159 a prime number?
Yes. 14159 is divisible only by 1 and itself.
What are the factors of 14159?
1, 14159.
What is 14159 in binary?
11011101001111 (hexadecimal 374F, octal 33517).
What is the square root of 14159?
About 118.9916.
Is 14159 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 14159?
14159 is the 1667th prime number.