The number 50051
50051 is a twin prime (50051 and 50053 are both prime) and the 5138th prime number. Its only divisors are 1 and 50051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50051: a twin prime (50051 and 50053 are both prime); the 5138th prime number.
- 2
50051 is prime, so its only factors are 1 and 50051. It is the 5138th prime; the next prime is 50053 and the one before is 50047.
- 3
The divisors add up to 50052; without 50051 itself that is 1, so 50051 is deficient (1 is less than 50051). Euler's totient φ(50051) = 50050 numbers up to 50051 share no factor with it.
- 4
The digits of 50051 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 88 steps to reach 1.
50051 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 50052 |
| Euler totient φ(n) | 50050 |
| Square | 2505102601 |
| Cube | 125382890282651 |
| Square root | 223.720808 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 88 |
| Scientific notation | 5.0051 × |
50051 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and fifty-one |
| Binary (base 2) | 1100001110000011 |
| Octal (base 8) | 141603 |
| Hexadecimal (base 16) | C383 |
| Base 3 | 2112122202 |
| As time | 50051 seconds = 13 h 54 min 11 s |
Is 50051 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 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 1) | 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 50051 a prime number?
Yes. 50051 is divisible only by 1 and itself.
What are the factors of 50051?
1, 50051.
What is 50051 in binary?
1100001110000011 (hexadecimal C383, octal 141603).
What is the square root of 50051?
About 223.7208.
Is 50051 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 50051?
50051 is a twin prime (50051 and 50053 are both prime); the 5138th prime number.