The number 16902
16902 is a composite number with 16 divisors. Its prime factorisation is 2 × × 313. Divisors (16): 1, 2, 3, 6, 9, 18, 27, 54, 313, 626, 939, 1878, 2817, 5634, 8451, 16902.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16902: a Harshad number: divisible by its digit sum 18.
- 2
16902 is composite. Its prime factorisation is
- 3
The divisors add up to 37680; without 16902 itself that is 20778, so 16902 is abundant (20778 is more than 16902). Euler's totient φ(16902) = 5616 numbers up to 16902 share no factor with it.
- 4
The digits of 16902 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16902 = 2 \times 3^{3} \times 313 \]16902 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 37680 |
| Euler totient φ(n) | 5616 |
| Square | 285677604 |
| Cube | 4828522862808 |
| Square root | 130.007692 (= 3√1878) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 58 |
| Scientific notation | 1.6902 × |
16902 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand nine hundred and two |
| Binary (base 2) | 100001000000110 |
| Octal (base 8) | 41006 |
| Hexadecimal (base 16) | 4206 |
| Base 3 | 212012000 |
| As time | 16902 seconds = 4 h 41 min 42 s |
Is 16902 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16902 ÷ 2 = 8451) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (16902 ÷ 3 = 5634) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 | Yes (16902 ÷ 6 = 2817) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (16902 ÷ 9 = 1878) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16902 a prime number?
No. 16902 = 2 × × 313, so it is divisible by 2.
What are the factors of 16902?
1, 2, 3, 6, 9, 18, 27, 54, 313, 626, 939, 1878, 2817, 5634, 8451, 16902.
What is 16902 in binary?
100001000000110 (hexadecimal 4206, octal 41006).
What is the square root of 16902?
About 130.0077, exactly 3√1878.
Is 16902 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 16902?
16902 is a Harshad number: divisible by its digit sum 18.