The number 51131
51131 is a twin prime (51131 and 51133 are both prime) and the 5231st prime number. Its only divisors are 1 and 51131.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51131: a twin prime (51131 and 51133 are both prime); the 5231st prime number.
- 2
51131 is prime, so its only factors are 1 and 51131. It is the 5231st prime; the next prime is 51133 and the one before is 51109.
- 3
The divisors add up to 51132; without 51131 itself that is 1, so 51131 is deficient (1 is less than 51131). Euler's totient φ(51131) = 51130 numbers up to 51131 share no factor with it.
- 4
The digits of 51131 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 39 steps to reach 1.
51131 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 51132 |
| Euler totient φ(n) | 51130 |
| Square | 2614379161 |
| Cube | 133675820881091 |
| Square root | 226.121649 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 39 |
| Scientific notation | 5.1131 × |
51131 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand one hundred and thirty-one |
| Binary (base 2) | 1100011110111011 |
| Octal (base 8) | 143673 |
| Hexadecimal (base 16) | C7BB |
| Base 3 | 2121010202 |
| As time | 51131 seconds = 14 h 12 min 11 s |
Is 51131 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 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 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 3) | 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 51131 a prime number?
Yes. 51131 is divisible only by 1 and itself.
What are the factors of 51131?
1, 51131.
What is 51131 in binary?
1100011110111011 (hexadecimal C7BB, octal 143673).
What is the square root of 51131?
About 226.1216.
Is 51131 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 51131?
51131 is a twin prime (51131 and 51133 are both prime); the 5231st prime number.