The number 16251
16251 is a composite number with 4 divisors. Its prime factorisation is 3 × 5417. Divisors (4): 1, 3, 5417, 16251.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16251: a semiprime: 3 × 5417, the product of two primes.
- 2
16251 is composite. Its prime factorisation is
- 3
The divisors add up to 21672; without 16251 itself that is 5421, so 16251 is deficient (5421 is less than 16251). Euler's totient φ(16251) = 10832 numbers up to 16251 share no factor with it.
- 4
The digits of 16251 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16251 = 3 \times 5417 \]
16251 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 21672 |
| Euler totient φ(n) | 10832 |
| Square | 264095001 |
| Cube | 4291807861251 |
| Square root | 127.479410 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 97 |
| Scientific notation | 1.6251 × |
16251 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand two hundred and fifty-one |
| Binary (base 2) | 11111101111011 |
| Octal (base 8) | 37573 |
| Hexadecimal (base 16) | 3F7B |
| Base 3 | 211021220 |
| As time | 16251 seconds = 4 h 30 min 51 s |
Is 16251 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 | Yes (16251 ÷ 3 = 5417) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16251 a prime number?
No. 16251 = 3 × 5417, so it is divisible by 3.
What are the factors of 16251?
1, 3, 5417, 16251.
What is 16251 in binary?
11111101111011 (hexadecimal 3F7B, octal 37573).
What is the square root of 16251?
About 127.4794.
Is 16251 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 16251?
16251 is a semiprime: 3 × 5417, the product of two primes.