The number 16002
16002 is a composite number with 24 divisors. Its prime factorisation is 2 × × 7 × 127. Divisors (24): 1, 2, 3, 6, 7, 9, 14, 18, 21, 42, 63, 126, 127, 254, 381, 762 … 16002.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16002: a Harshad number: divisible by its digit sum 9.
- 2
16002 is composite. Its prime factorisation is
- 3
The divisors add up to 39936; without 16002 itself that is 23934, so 16002 is abundant (23934 is more than 16002). Euler's totient φ(16002) = 4536 numbers up to 16002 share no factor with it.
- 4
The digits of 16002 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16002 = 2 \times 3^{2} \times 7 \times 127 \]16002 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 39936 |
| Euler totient φ(n) | 4536 |
| Square | 256064004 |
| Cube | 4097536192008 |
| Square root | 126.499012 (= 3√1778) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 53 |
| Scientific notation | 1.6002 × |
16002 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand and two |
| Binary (base 2) | 11111010000010 |
| Octal (base 8) | 37202 |
| Hexadecimal (base 16) | 3E82 |
| Base 3 | 210221200 |
| As time | 16002 seconds = 4 h 26 min 42 s |
Is 16002 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16002 ÷ 2 = 8001) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (16002 ÷ 3 = 5334) | 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 (16002 ÷ 6 = 2667) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (16002 ÷ 7 = 2286) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (16002 ÷ 9 = 1778) | 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 8) | 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 16002 a prime number?
No. 16002 = 2 × × 7 × 127, so it is divisible by 2.
What are the factors of 16002?
1, 2, 3, 6, 7, 9, 14, 18, 21, 42, 63, 126, 127, 254, 381, 762, 889, 1143, 1778, 2286, 2667, 5334, 8001, 16002.
What is 16002 in binary?
11111010000010 (hexadecimal 3E82, octal 37202).
What is the square root of 16002?
About 126.4990, exactly 3√1778.
Is 16002 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 16002?
16002 is a Harshad number: divisible by its digit sum 9.