The number 16151
16151 is a composite number with 4 divisors. Its prime factorisation is 31 × 521. Divisors (4): 1, 31, 521, 16151.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16151: a semiprime: 31 × 521, the product of two primes.
- 2
16151 is composite. Its prime factorisation is
- 3
The divisors add up to 16704; without 16151 itself that is 553, so 16151 is deficient (553 is less than 16151). Euler's totient φ(16151) = 15600 numbers up to 16151 share no factor with it.
- 4
The digits of 16151 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16151 = 31 \times 521 \]
16151 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16704 |
| Euler totient φ(n) | 15600 |
| Square | 260854801 |
| Cube | 4213065890951 |
| Square root | 127.086585 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.6151 × |
16151 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand one hundred and fifty-one |
| Binary (base 2) | 11111100010111 |
| Octal (base 8) | 37427 |
| Hexadecimal (base 16) | 3F17 |
| Base 3 | 211011012 |
| As time | 16151 seconds = 4 h 29 min 11 s |
Is 16151 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 1) | 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 2) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 16151 a prime number?
No. 16151 = 31 × 521, so it is divisible by 31.
What are the factors of 16151?
1, 31, 521, 16151.
What is 16151 in binary?
11111100010111 (hexadecimal 3F17, octal 37427).
What is the square root of 16151?
About 127.0866.
Is 16151 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 16151?
16151 is a semiprime: 31 × 521, the product of two primes.