The number 16589
16589 is a composite number with 4 divisors. Its prime factorisation is 53 × 313. Divisors (4): 1, 53, 313, 16589.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16589: a semiprime: 53 × 313, the product of two primes.
- 2
16589 is composite. Its prime factorisation is
- 3
The divisors add up to 16956; without 16589 itself that is 367, so 16589 is deficient (367 is less than 16589). Euler's totient φ(16589) = 16224 numbers up to 16589 share no factor with it.
- 4
The digits of 16589 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16589 = 53 \times 313 \]
16589 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16956 |
| Euler totient φ(n) | 16224 |
| Square | 275194921 |
| Cube | 4565208544469 |
| Square root | 128.798292 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.6589 × |
16589 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand five hundred and eighty-nine |
| Binary (base 2) | 100000011001101 |
| Octal (base 8) | 40315 |
| Hexadecimal (base 16) | 40CD |
| Base 3 | 211202102 |
| As time | 16589 seconds = 4 h 36 min 29 s |
Is 16589 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16589 a prime number?
No. 16589 = 53 × 313, so it is divisible by 53.
What are the factors of 16589?
1, 53, 313, 16589.
What is 16589 in binary?
100000011001101 (hexadecimal 40CD, octal 40315).
What is the square root of 16589?
About 128.7983.
Is 16589 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 16589?
16589 is a semiprime: 53 × 313, the product of two primes.