The number 51752
51752 is a composite number with 8 divisors. Its prime factorisation is × 6469. Divisors (8): 1, 2, 4, 8, 6469, 12938, 25876, 51752.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51752 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51752 is composite. Its prime factorisation is
- 3
The divisors add up to 97050; without 51752 itself that is 45298, so 51752 is deficient (45298 is less than 51752). Euler's totient φ(51752) = 25872 numbers up to 51752 share no factor with it.
- 4
The digits of 51752 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 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51752 = 2^{3} \times 6469 \]51752 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 97050 |
| Euler totient φ(n) | 25872 |
| Square | 2678269504 |
| Cube | 138605803371008 |
| Square root | 227.490659 (= 2√12938) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.1752 × |
51752 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand seven hundred and fifty-two |
| Binary (base 2) | 1100101000101000 |
| Octal (base 8) | 145050 |
| Hexadecimal (base 16) | CA28 |
| Base 3 | 2121222202 |
| As time | 51752 seconds = 14 h 22 min 32 s |
Is 51752 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51752 ÷ 2 = 25876) | 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 | Yes (51752 ÷ 4 = 12938) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 | Yes (51752 ÷ 8 = 6469) | 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 2) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51752 a prime number?
No. 51752 = × 6469, so it is divisible by 2.
What are the factors of 51752?
1, 2, 4, 8, 6469, 12938, 25876, 51752.
What is 51752 in binary?
1100101000101000 (hexadecimal CA28, octal 145050).
What is the square root of 51752?
About 227.4907, exactly 2√12938.
Is 51752 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 51752?
It is a composite number with 8 divisors.