The number 16157
16157 is a composite number with 4 divisors. Its prime factorisation is 107 × 151. Divisors (4): 1, 107, 151, 16157.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16157: a semiprime: 107 × 151, the product of two primes.
- 2
16157 is composite. Its prime factorisation is
- 3
The divisors add up to 16416; without 16157 itself that is 259, so 16157 is deficient (259 is less than 16157). Euler's totient φ(16157) = 15900 numbers up to 16157 share no factor with it.
- 4
The digits of 16157 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 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16157 = 107 \times 151 \]
16157 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16416 |
| Euler totient φ(n) | 15900 |
| Square | 261048649 |
| Cube | 4217763021893 |
| Square root | 127.110188 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 146 |
| Scientific notation | 1.6157 × |
16157 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand one hundred and fifty-seven |
| Binary (base 2) | 11111100011101 |
| Octal (base 8) | 37435 |
| Hexadecimal (base 16) | 3F1D |
| Base 3 | 211011102 |
| As time | 16157 seconds = 4 h 29 min 17 s |
Is 16157 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 1) | 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 5) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16157 a prime number?
No. 16157 = 107 × 151, so it is divisible by 107.
What are the factors of 16157?
1, 107, 151, 16157.
What is 16157 in binary?
11111100011101 (hexadecimal 3F1D, octal 37435).
What is the square root of 16157?
About 127.1102.
Is 16157 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 16157?
16157 is a semiprime: 107 × 151, the product of two primes.