The number 16606
16606 is a composite number with 12 divisors. Its prime factorisation is 2 × × 23. Divisors (12): 1, 2, 19, 23, 38, 46, 361, 437, 722, 874, 8303, 16606.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16606: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 19.
- 2
16606 is composite. Its prime factorisation is
- 3
The divisors add up to 27432; without 16606 itself that is 10826, so 16606 is deficient (10826 is less than 16606). Euler's totient φ(16606) = 7524 numbers up to 16606 share no factor with it.
- 4
The digits of 16606 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 128 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16606 = 2 \times 19^{2} \times 23 \]16606 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 27432 |
| Euler totient φ(n) | 7524 |
| Square | 275759236 |
| Cube | 4579257873016 |
| Square root | 128.864270 (= 19√46) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 128 |
| Scientific notation | 1.6606 × |
16606 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand six hundred and six |
| Binary (base 2) | 100000011011110 |
| Octal (base 8) | 40336 |
| Hexadecimal (base 16) | 40DE |
| Base 3 | 211210001 |
| As time | 16606 seconds = 4 h 36 min 46 s |
Is 16606 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16606 ÷ 2 = 8303) | 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 1) | 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 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 6) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 16606 a prime number?
No. 16606 = 2 × × 23, so it is divisible by 2.
What are the factors of 16606?
1, 2, 19, 23, 38, 46, 361, 437, 722, 874, 8303, 16606.
What is 16606 in binary?
100000011011110 (hexadecimal 40DE, octal 40336).
What is the square root of 16606?
About 128.8643, exactly 19√46.
Is 16606 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 16606?
16606 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 19.