The number 16851
16851 is a composite number with 8 divisors. Its prime factorisation is 3 × 41 × 137. Divisors (8): 1, 3, 41, 123, 137, 411, 5617, 16851.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
16851 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
16851 is composite. Its prime factorisation is
- 3
The divisors add up to 23184; without 16851 itself that is 6333, so 16851 is deficient (6333 is less than 16851). Euler's totient φ(16851) = 10880 numbers up to 16851 share no factor with it.
- 4
The digits of 16851 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 203 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16851 = 3 \times 41 \times 137 \]
16851 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 23184 |
| Euler totient φ(n) | 10880 |
| Square | 283956201 |
| Cube | 4784945943051 |
| Square root | 129.811402 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 203 |
| Scientific notation | 1.6851 × |
16851 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand eight hundred and fifty-one |
| Binary (base 2) | 100000111010011 |
| Octal (base 8) | 40723 |
| Hexadecimal (base 16) | 41D3 |
| Base 3 | 212010010 |
| As time | 16851 seconds = 4 h 40 min 51 s |
Is 16851 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 (16851 ÷ 3 = 5617) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 10) | 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 16851 a prime number?
No. 16851 = 3 × 41 × 137, so it is divisible by 3.
What are the factors of 16851?
1, 3, 41, 123, 137, 411, 5617, 16851.
What is 16851 in binary?
100000111010011 (hexadecimal 41D3, octal 40723).
What is the square root of 16851?
About 129.8114.
Is 16851 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 16851?
It is a composite number with 8 divisors.