The number 21590
21590 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 17 × 127. Divisors (16): 1, 2, 5, 10, 17, 34, 85, 127, 170, 254, 635, 1270, 2159, 4318, 10795, 21590.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 21590: a Harshad number: divisible by its digit sum 17.
- 2
21590 is composite. Its prime factorisation is
- 3
The divisors add up to 41472; without 21590 itself that is 19882, so 21590 is deficient (19882 is less than 21590). Euler's totient φ(21590) = 8064 numbers up to 21590 share no factor with it.
- 4
The digits of 21590 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 69 steps to reach 1.
LaTeX source of the formulas on this page
\[ 21590 = 2 \times 5 \times 17 \times 127 \]
21590 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 41472 |
| Euler totient φ(n) | 8064 |
| Square | 466128100 |
| Cube | 10063705679000 |
| Square root | 146.935360 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 69 |
| Scientific notation | 2.159 × |
21590 in other forms
| Form | Value |
|---|---|
| In words | twenty-one thousand five hundred and ninety |
| Binary (base 2) | 101010001010110 |
| Octal (base 8) | 52126 |
| Hexadecimal (base 16) | 5456 |
| Base 3 | 1002121122 |
| As time | 21590 seconds = 5 h 59 min 50 s |
Is 21590 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (21590 ÷ 2 = 10795) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 (21590 ÷ 5 = 4318) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (21590 ÷ 10 = 2159) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 21590 a prime number?
No. 21590 = 2 × 5 × 17 × 127, so it is divisible by 2.
What are the factors of 21590?
1, 2, 5, 10, 17, 34, 85, 127, 170, 254, 635, 1270, 2159, 4318, 10795, 21590.
What is 21590 in binary?
101010001010110 (hexadecimal 5456, octal 52126).
What is the square root of 21590?
About 146.9354.
Is 21590 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 21590?
21590 is a Harshad number: divisible by its digit sum 17.