The number 52751
52751 is a composite number with 8 divisors. Its prime factorisation is 17 × 29 × 107. Divisors (8): 1, 17, 29, 107, 493, 1819, 3103, 52751.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
52751 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
52751 is composite. Its prime factorisation is
- 3
The divisors add up to 58320; without 52751 itself that is 5569, so 52751 is deficient (5569 is less than 52751). Euler's totient φ(52751) = 47488 numbers up to 52751 share no factor with it.
- 4
The digits of 52751 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52751 = 17 \times 29 \times 107 \]
52751 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 58320 |
| Euler totient φ(n) | 47488 |
| Square | 2782668001 |
| Cube | 146788519720751 |
| Square root | 229.675859 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.2751 × |
52751 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand seven hundred and fifty-one |
| Binary (base 2) | 1100111000001111 |
| Octal (base 8) | 147017 |
| Hexadecimal (base 16) | CE0F |
| Base 3 | 2200100202 |
| As time | 52751 seconds = 14 h 39 min 11 s |
Is 52751 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 6) | 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 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 6) | 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 52751 a prime number?
No. 52751 = 17 × 29 × 107, so it is divisible by 17.
What are the factors of 52751?
1, 17, 29, 107, 493, 1819, 3103, 52751.
What is 52751 in binary?
1100111000001111 (hexadecimal CE0F, octal 147017).
What is the square root of 52751?
About 229.6759.
Is 52751 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 52751?
It is a composite number with 8 divisors.