The number 53051
53051 is the 5412th prime number. Its only divisors are 1 and 53051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53051: the 5412th prime number.
- 2
53051 is prime, so its only factors are 1 and 53051. It is the 5412th prime; the next prime is 53069 and the one before is 53047.
- 3
The divisors add up to 53052; without 53051 itself that is 1, so 53051 is deficient (1 is less than 53051). Euler's totient φ(53051) = 53050 numbers up to 53051 share no factor with it.
- 4
The digits of 53051 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
53051 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 53052 |
| Euler totient φ(n) | 53050 |
| Square | 2814408601 |
| Cube | 149307190691651 |
| Square root | 230.328027 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.3051 × |
53051 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand and fifty-one |
| Binary (base 2) | 1100111100111011 |
| Octal (base 8) | 147473 |
| Hexadecimal (base 16) | CF3B |
| Base 3 | 2200202212 |
| As time | 53051 seconds = 14 h 44 min 11 s |
Is 53051 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 5) | 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 5) | 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 9) | 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 53051 a prime number?
Yes. 53051 is divisible only by 1 and itself.
What are the factors of 53051?
1, 53051.
What is 53051 in binary?
1100111100111011 (hexadecimal CF3B, octal 147473).
What is the square root of 53051?
About 230.3280.
Is 53051 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 53051?
53051 is the 5412th prime number.