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