The number 16690
16690 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 1669. Divisors (8): 1, 2, 5, 10, 1669, 3338, 8345, 16690.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
16690 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
16690 is composite. Its prime factorisation is
- 3
The divisors add up to 30060; without 16690 itself that is 13370, so 16690 is deficient (13370 is less than 16690). Euler's totient φ(16690) = 6672 numbers up to 16690 share no factor with it.
- 4
The digits of 16690 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16690 = 2 \times 5 \times 1669 \]
16690 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 30060 |
| Euler totient φ(n) | 6672 |
| Square | 278556100 |
| Cube | 4649101309000 |
| Square root | 129.189783 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 115 |
| Scientific notation | 1.669 × |
16690 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand six hundred and ninety |
| Binary (base 2) | 100000100110010 |
| Octal (base 8) | 40462 |
| Hexadecimal (base 16) | 4132 |
| Base 3 | 211220011 |
| As time | 16690 seconds = 4 h 38 min 10 s |
Is 16690 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16690 ÷ 2 = 8345) | 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 | Yes (16690 ÷ 5 = 3338) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (16690 ÷ 10 = 1669) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 16690 a prime number?
No. 16690 = 2 × 5 × 1669, so it is divisible by 2.
What are the factors of 16690?
1, 2, 5, 10, 1669, 3338, 8345, 16690.
What is 16690 in binary?
100000100110010 (hexadecimal 4132, octal 40462).
What is the square root of 16690?
About 129.1898.
Is 16690 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 16690?
It is a composite number with 8 divisors.