The number 590
590 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 59. Divisors (8): 1, 2, 5, 10, 59, 118, 295, 590.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
590 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
590 is composite. Its prime factorisation is
- 3
The divisors add up to 1080; without 590 itself that is 490, so 590 is deficient (490 is less than 590). Euler's totient φ(590) = 232 numbers up to 590 share no factor with it.
- 4
The digits of 590 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 56 steps to reach 1.
LaTeX source of the formulas on this page
\[ 590 = 2 \times 5 \times 59 \]
590 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 1080 |
| Euler totient φ(n) | 232 |
| Square | 348100 |
| Cube | 205379000 |
| Square root | 24.289916 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 56 |
| Scientific notation | 5.9 × |
590 in other forms
| Form | Value |
|---|---|
| In words | five hundred and ninety |
| Roman numerals | DXC |
| Binary (base 2) | 1001001110 |
| Octal (base 8) | 1116 |
| Hexadecimal (base 16) | 24E |
| Base 3 | 210212 |
| As time | 590 seconds = 9 min 50 s |
Is 590 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (590 ÷ 2 = 295) | 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 (590 ÷ 5 = 118) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (590 ÷ 10 = 59) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 590 a prime number?
No. 590 = 2 × 5 × 59, so it is divisible by 2.
What are the factors of 590?
1, 2, 5, 10, 59, 118, 295, 590.
What is 590 in binary?
1001001110 (hexadecimal 24E, octal 1116).
What is the square root of 590?
About 24.2899.
What is 590 in Roman numerals?
DXC.
Is 590 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 590?
It is a composite number with 8 divisors.