The number 50131
50131 is a twin prime (50129 and 50131 are both prime) and the 5149th prime number. Its only divisors are 1 and 50131.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50131: a twin prime (50129 and 50131 are both prime); the 5149th prime number.
- 2
50131 is prime, so its only factors are 1 and 50131. It is the 5149th prime; the next prime is 50147 and the one before is 50129.
- 3
The divisors add up to 50132; without 50131 itself that is 1, so 50131 is deficient (1 is less than 50131). Euler's totient φ(50131) = 50130 numbers up to 50131 share no factor with it.
- 4
The digits of 50131 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
50131 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 50132 |
| Euler totient φ(n) | 50130 |
| Square | 2513117161 |
| Cube | 125985076398091 |
| Square root | 223.899531 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 114 |
| Scientific notation | 5.0131 × |
50131 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand one hundred and thirty-one |
| Binary (base 2) | 1100001111010011 |
| Octal (base 8) | 141723 |
| Hexadecimal (base 16) | C3D3 |
| Base 3 | 2112202201 |
| As time | 50131 seconds = 13 h 55 min 31 s |
Is 50131 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 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50131 a prime number?
Yes. 50131 is divisible only by 1 and itself.
What are the factors of 50131?
1, 50131.
What is 50131 in binary?
1100001111010011 (hexadecimal C3D3, octal 141723).
What is the square root of 50131?
About 223.8995.
Is 50131 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 50131?
50131 is a twin prime (50129 and 50131 are both prime); the 5149th prime number.