The number 16159
16159 is a composite number with 8 divisors. Its prime factorisation is 11 × 13 × 113. Divisors (8): 1, 11, 13, 113, 143, 1243, 1469, 16159.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
16159 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
16159 is composite. Its prime factorisation is
- 3
The divisors add up to 19152; without 16159 itself that is 2993, so 16159 is deficient (2993 is less than 16159). Euler's totient φ(16159) = 13440 numbers up to 16159 share no factor with it.
- 4
The digits of 16159 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 190 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16159 = 11 \times 13 \times 113 \]
16159 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 19152 |
| Euler totient φ(n) | 13440 |
| Square | 261113281 |
| Cube | 4219329507679 |
| Square root | 127.118055 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 190 |
| Scientific notation | 1.6159 × |
16159 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand one hundred and fifty-nine |
| Binary (base 2) | 11111100011111 |
| Octal (base 8) | 37437 |
| Hexadecimal (base 16) | 3F1F |
| Base 3 | 211011111 |
| As time | 16159 seconds = 4 h 29 min 19 s |
Is 16159 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 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 4) | 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 | Yes (16159 ÷ 11 = 1469) | 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 16159 a prime number?
No. 16159 = 11 × 13 × 113, so it is divisible by 11.
What are the factors of 16159?
1, 11, 13, 113, 143, 1243, 1469, 16159.
What is 16159 in binary?
11111100011111 (hexadecimal 3F1F, octal 37437).
What is the square root of 16159?
About 127.1181.
Is 16159 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 16159?
It is a composite number with 8 divisors.