The number 591
591 is a composite number with 4 divisors. Its prime factorisation is 3 × 197. Divisors (4): 1, 3, 197, 591.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 591: a semiprime: 3 × 197, the product of two primes.
- 2
591 is composite. Its prime factorisation is
- 3
The divisors add up to 792; without 591 itself that is 201, so 591 is deficient (201 is less than 591). Euler's totient φ(591) = 392 numbers up to 591 share no factor with it.
- 4
The digits of 591 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 56 steps to reach 1.
LaTeX source of the formulas on this page
\[ 591 = 3 \times 197 \]
591 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 792 |
| Euler totient φ(n) | 392 |
| Square | 349281 |
| Cube | 206425071 |
| Square root | 24.310492 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 56 |
| Scientific notation | 5.91 × |
591 in other forms
| Form | Value |
|---|---|
| In words | five hundred and ninety-one |
| Roman numerals | DXCI |
| Binary (base 2) | 1001001111 |
| Octal (base 8) | 1117 |
| Hexadecimal (base 16) | 24F |
| Base 3 | 210220 |
| As time | 591 seconds = 9 min 51 s |
Is 591 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 | Yes (591 ÷ 3 = 197) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 591 a prime number?
No. 591 = 3 × 197, so it is divisible by 3.
What are the factors of 591?
1, 3, 197, 591.
What is 591 in binary?
1001001111 (hexadecimal 24F, octal 1117).
What is the square root of 591?
About 24.3105.
What is 591 in Roman numerals?
DXCI.
Is 591 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 591?
591 is a semiprime: 3 × 197, the product of two primes.