The number 50893
50893 is a twin prime (50891 and 50893 are both prime) and the 5213th prime number. Its only divisors are 1 and 50893.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50893: a twin prime (50891 and 50893 are both prime); the 5213th prime number.
- 2
50893 is prime, so its only factors are 1 and 50893. It is the 5213th prime; the next prime is 50909 and the one before is 50891.
- 3
The divisors add up to 50894; without 50893 itself that is 1, so 50893 is deficient (1 is less than 50893). Euler's totient φ(50893) = 50892 numbers up to 50893 share no factor with it.
- 4
The digits of 50893 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
50893 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 50894 |
| Euler totient φ(n) | 50892 |
| Square | 2590097449 |
| Cube | 131817829471957 |
| Square root | 225.594769 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0893 × |
50893 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand eight hundred and ninety-three |
| Binary (base 2) | 1100011011001101 |
| Octal (base 8) | 143315 |
| Hexadecimal (base 16) | C6CD |
| Base 3 | 2120210221 |
| As time | 50893 seconds = 14 h 8 min 13 s |
Is 50893 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 7) | 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 50893 a prime number?
Yes. 50893 is divisible only by 1 and itself.
What are the factors of 50893?
1, 50893.
What is 50893 in binary?
1100011011001101 (hexadecimal C6CD, octal 143315).
What is the square root of 50893?
About 225.5948.
Is 50893 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 50893?
50893 is a twin prime (50891 and 50893 are both prime); the 5213th prime number.