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