The number 50591
50591 is a twin prime (50591 and 50593 are both prime) and the 5189th prime number. Its only divisors are 1 and 50591.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50591: a twin prime (50591 and 50593 are both prime); the 5189th prime number.
- 2
50591 is prime, so its only factors are 1 and 50591. It is the 5189th prime; the next prime is 50593 and the one before is 50587.
- 3
The divisors add up to 50592; without 50591 itself that is 1, so 50591 is deficient (1 is less than 50591). Euler's totient φ(50591) = 50590 numbers up to 50591 share no factor with it.
- 4
The digits of 50591 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 202 steps to reach 1.
50591 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 50592 |
| Euler totient φ(n) | 50590 |
| Square | 2559449281 |
| Cube | 129485098575071 |
| Square root | 224.924432 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.0591 × |
50591 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and ninety-one |
| Binary (base 2) | 1100010110011111 |
| Octal (base 8) | 142637 |
| Hexadecimal (base 16) | C59F |
| Base 3 | 2120101202 |
| As time | 50591 seconds = 14 h 3 min 11 s |
Is 50591 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 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 5) | 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 7) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50591 a prime number?
Yes. 50591 is divisible only by 1 and itself.
What are the factors of 50591?
1, 50591.
What is 50591 in binary?
1100010110011111 (hexadecimal C59F, octal 142637).
What is the square root of 50591?
About 224.9244.
Is 50591 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 50591?
50591 is a twin prime (50591 and 50593 are both prime); the 5189th prime number.