The number 20159
20159 is a composite number with 4 divisors. Its prime factorisation is 19 × 1061. Divisors (4): 1, 19, 1061, 20159.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20159: a semiprime: 19 × 1061, the product of two primes.
- 2
20159 is composite. Its prime factorisation is
- 3
The divisors add up to 21240; without 20159 itself that is 1081, so 20159 is deficient (1081 is less than 20159). Euler's totient φ(20159) = 19080 numbers up to 20159 share no factor with it.
- 4
The digits of 20159 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 242 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20159 = 19 \times 1061 \]
20159 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 21240 |
| Euler totient φ(n) | 19080 |
| Square | 406385281 |
| Cube | 8192320879679 |
| Square root | 141.982393 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 242 |
| Scientific notation | 2.0159 × |
20159 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand one hundred and fifty-nine |
| Binary (base 2) | 100111010111111 |
| Octal (base 8) | 47277 |
| Hexadecimal (base 16) | 4EBF |
| Base 3 | 1000122122 |
| As time | 20159 seconds = 5 h 35 min 59 s |
Is 20159 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 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 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 7) | 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 20159 a prime number?
No. 20159 = 19 × 1061, so it is divisible by 19.
What are the factors of 20159?
1, 19, 1061, 20159.
What is 20159 in binary?
100111010111111 (hexadecimal 4EBF, octal 47277).
What is the square root of 20159?
About 141.9824.
Is 20159 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 20159?
20159 is a semiprime: 19 × 1061, the product of two primes.