The number 2159
2159 is a composite number with 4 divisors. Its prime factorisation is 17 × 127. Divisors (4): 1, 17, 127, 2159.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 2159: a Harshad number: divisible by its digit sum 17; a semiprime: 17 × 127, the product of two primes.
- 2
2159 is composite. Its prime factorisation is
- 3
The divisors add up to 2304; without 2159 itself that is 145, so 2159 is deficient (145 is less than 2159). Euler's totient φ(2159) = 2016 numbers up to 2159 share no factor with it.
- 4
The digits of 2159 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 125 steps to reach 1.
LaTeX source of the formulas on this page
\[ 2159 = 17 \times 127 \]
2159 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 2304 |
| Euler totient φ(n) | 2016 |
| Square | 4661281 |
| Cube | 10063705679 |
| Square root | 46.465041 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 125 |
| Scientific notation | 2.159 × |
2159 in other forms
| Form | Value |
|---|---|
| In words | two thousand one hundred and fifty-nine |
| Roman numerals | MMCLIX |
| Binary (base 2) | 100001101111 |
| Octal (base 8) | 4157 |
| Hexadecimal (base 16) | 86F |
| Base 3 | 2221222 |
| As time | 2159 seconds = 35 min 59 s |
Is 2159 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 3) | 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 3) | 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 2159 a prime number?
No. 2159 = 17 × 127, so it is divisible by 17.
What are the factors of 2159?
1, 17, 127, 2159.
What is 2159 in binary?
100001101111 (hexadecimal 86F, octal 4157).
What is the square root of 2159?
About 46.4650.
What is 2159 in Roman numerals?
MMCLIX.
Is 2159 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 2159?
2159 is a Harshad number: divisible by its digit sum 17; a semiprime: 17 × 127, the product of two primes.