The number 5051
5051 is the 676th prime number. Its only divisors are 1 and 5051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5051: the 676th prime number.
- 2
5051 is prime, so its only factors are 1 and 5051. It is the 676th prime; the next prime is 5059 and the one before is 5039.
- 3
The divisors add up to 5052; without 5051 itself that is 1, so 5051 is deficient (1 is less than 5051). Euler's totient φ(5051) = 5050 numbers up to 5051 share no factor with it.
- 4
The digits of 5051 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 85 steps to reach 1.
5051 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 5052 |
| Euler totient φ(n) | 5050 |
| Square | 25512601 |
| Cube | 128864147651 |
| Square root | 71.070388 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 85 |
| Scientific notation | 5.051 × |
5051 in other forms
| Form | Value |
|---|---|
| In words | five thousand and fifty-one |
| Binary (base 2) | 1001110111011 |
| Octal (base 8) | 11673 |
| Hexadecimal (base 16) | 13BB |
| Base 3 | 20221002 |
| As time | 5051 seconds = 1 h 24 min 11 s |
Is 5051 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 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 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 2) | 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 5051 a prime number?
Yes. 5051 is divisible only by 1 and itself.
What are the factors of 5051?
1, 5051.
What is 5051 in binary?
1001110111011 (hexadecimal 13BB, octal 11673).
What is the square root of 5051?
About 71.0704.
Is 5051 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 5051?
5051 is the 676th prime number.