The number 1589
1589 is a composite number with 4 divisors. Its prime factorisation is 7 × 227. Divisors (4): 1, 7, 227, 1589.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1589: a semiprime: 7 × 227, the product of two primes.
- 2
1589 is composite. Its prime factorisation is
- 3
The divisors add up to 1824; without 1589 itself that is 235, so 1589 is deficient (235 is less than 1589). Euler's totient φ(1589) = 1356 numbers up to 1589 share no factor with it.
- 4
The digits of 1589 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 29 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1589 = 7 \times 227 \]
1589 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1824 |
| Euler totient φ(n) | 1356 |
| Square | 2524921 |
| Cube | 4012099469 |
| Square root | 39.862263 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 29 |
| Scientific notation | 1.589 × |
1589 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and eighty-nine |
| Roman numerals | MDLXXXIX |
| Binary (base 2) | 11000110101 |
| Octal (base 8) | 3065 |
| Hexadecimal (base 16) | 635 |
| Base 3 | 2011212 |
| As time | 1589 seconds = 26 min 29 s |
Is 1589 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 | Yes (1589 ÷ 7 = 227) | 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 5) | 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 5) | 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 1589 a prime number?
No. 1589 = 7 × 227, so it is divisible by 7.
What are the factors of 1589?
1, 7, 227, 1589.
What is 1589 in binary?
11000110101 (hexadecimal 635, octal 3065).
What is the square root of 1589?
About 39.8623.
What is 1589 in Roman numerals?
MDLXXXIX.
Is 1589 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 1589?
1589 is a semiprime: 7 × 227, the product of two primes.