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