The number 16590
16590 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 5 × 7 × 79. Divisors (32): 1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 79, 105 … 16590.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16590: a Harshad number: divisible by its digit sum 21.
- 2
16590 is composite. Its prime factorisation is
- 3
The divisors add up to 46080; without 16590 itself that is 29490, so 16590 is abundant (29490 is more than 16590). Euler's totient φ(16590) = 3744 numbers up to 16590 share no factor with it.
- 4
The digits of 16590 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16590 = 2 \times 3 \times 5 \times 7 \times 79 \]
16590 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 46080 |
| Euler totient φ(n) | 3744 |
| Square | 275228100 |
| Cube | 4566034179000 |
| Square root | 128.802174 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 97 |
| Scientific notation | 1.659 × |
16590 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand five hundred and ninety |
| Binary (base 2) | 100000011001110 |
| Octal (base 8) | 40316 |
| Hexadecimal (base 16) | 40CE |
| Base 3 | 211202110 |
| As time | 16590 seconds = 4 h 36 min 30 s |
Is 16590 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16590 ÷ 2 = 8295) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (16590 ÷ 3 = 5530) | 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 (16590 ÷ 5 = 3318) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (16590 ÷ 6 = 2765) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (16590 ÷ 7 = 2370) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (16590 ÷ 10 = 1659) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 16590 a prime number?
No. 16590 = 2 × 3 × 5 × 7 × 79, so it is divisible by 2.
What are the factors of 16590?
1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 79, 105, 158, 210, 237, 395, 474, 553, 790, 1106, 1185, 1659, 2370, 2765, 3318, 5530, 8295, 16590.
What is 16590 in binary?
100000011001110 (hexadecimal 40CE, octal 40316).
What is the square root of 16590?
About 128.8022.
Is 16590 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 16590?
16590 is a Harshad number: divisible by its digit sum 21.