The number 52951
52951 is the 5402nd prime number. Its only divisors are 1 and 52951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52951: the 5402nd prime number.
- 2
52951 is prime, so its only factors are 1 and 52951. It is the 5402nd prime; the next prime is 52957 and the one before is 52937.
- 3
The divisors add up to 52952; without 52951 itself that is 1, so 52951 is deficient (1 is less than 52951). Euler's totient φ(52951) = 52950 numbers up to 52951 share no factor with it.
- 4
The digits of 52951 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 171 steps to reach 1.
52951 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 52952 |
| Euler totient φ(n) | 52950 |
| Square | 2803808401 |
| Cube | 148464458641351 |
| Square root | 230.110843 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.2951 × |
52951 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand nine hundred and fifty-one |
| Binary (base 2) | 1100111011010111 |
| Octal (base 8) | 147327 |
| Hexadecimal (base 16) | CED7 |
| Base 3 | 2200122011 |
| As time | 52951 seconds = 14 h 42 min 31 s |
Is 52951 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 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 7) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 52951 a prime number?
Yes. 52951 is divisible only by 1 and itself.
What are the factors of 52951?
1, 52951.
What is 52951 in binary?
1100111011010111 (hexadecimal CED7, octal 147327).
What is the square root of 52951?
About 230.1108.
Is 52951 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 52951?
52951 is the 5402nd prime number.