The number 16642
16642 is a composite number with 8 divisors. Its prime factorisation is 2 × 53 × 157. Divisors (8): 1, 2, 53, 106, 157, 314, 8321, 16642.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
16642 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
16642 is composite. Its prime factorisation is
- 3
The divisors add up to 25596; without 16642 itself that is 8954, so 16642 is deficient (8954 is less than 16642). Euler's totient φ(16642) = 8112 numbers up to 16642 share no factor with it.
- 4
The digits of 16642 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16642 = 2 \times 53 \times 157 \]
16642 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 25596 |
| Euler totient φ(n) | 8112 |
| Square | 276956164 |
| Cube | 4609104481288 |
| Square root | 129.003876 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 53 |
| Scientific notation | 1.6642 × |
16642 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand six hundred and forty-two |
| Binary (base 2) | 100000100000010 |
| Octal (base 8) | 40402 |
| Hexadecimal (base 16) | 4102 |
| Base 3 | 211211101 |
| As time | 16642 seconds = 4 h 37 min 22 s |
Is 16642 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16642 ÷ 2 = 8321) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 | No (remainder 1) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16642 a prime number?
No. 16642 = 2 × 53 × 157, so it is divisible by 2.
What are the factors of 16642?
1, 2, 53, 106, 157, 314, 8321, 16642.
What is 16642 in binary?
100000100000010 (hexadecimal 4102, octal 40402).
What is the square root of 16642?
About 129.0039.
Is 16642 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 16642?
It is a composite number with 8 divisors.