The number 52752
52752 is a composite number with 40 divisors. Its prime factorisation is × 3 × 7 × 157. Divisors (40): 1, 2, 3, 4, 6, 7, 8, 12, 14, 16, 21, 24, 28, 42, 48, 56 … 52752.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52752: a Harshad number: divisible by its digit sum 21.
- 2
52752 is composite. Its prime factorisation is
- 3
The divisors add up to 156736; without 52752 itself that is 103984, so 52752 is abundant (103984 is more than 52752). Euler's totient φ(52752) = 14976 numbers up to 52752 share no factor with it.
- 4
The digits of 52752 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52752 = 2^{4} \times 3 \times 7 \times 157 \]52752 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 40 |
| Sum of divisors | 156736 |
| Euler totient φ(n) | 14976 |
| Square | 2782773504 |
| Cube | 146796867883008 |
| Square root | 229.678036 (= 4√3297) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.2752 × |
52752 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand seven hundred and fifty-two |
| Binary (base 2) | 1100111000010000 |
| Octal (base 8) | 147020 |
| Hexadecimal (base 16) | CE10 |
| Base 3 | 2200100210 |
| As time | 52752 seconds = 14 h 39 min 12 s |
Is 52752 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52752 ÷ 2 = 26376) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (52752 ÷ 3 = 17584) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (52752 ÷ 4 = 13188) | 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 | Yes (52752 ÷ 6 = 8792) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (52752 ÷ 7 = 7536) | 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 (52752 ÷ 8 = 6594) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (52752 ÷ 12 = 4396) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52752 a prime number?
No. 52752 = × 3 × 7 × 157, so it is divisible by 2.
What are the factors of 52752?
1, 2, 3, 4, 6, 7, 8, 12, 14, 16, 21, 24, 28, 42, 48, 56, 84, 112, 157, 168, 314, 336, 471, 628, 942, 1099, 1256, 1884, 2198, 2512, 3297, 3768, 4396, 6594, 7536, 8792, 13188, 17584, 26376, 52752.
What is 52752 in binary?
1100111000010000 (hexadecimal CE10, octal 147020).
What is the square root of 52752?
About 229.6780, exactly 4√3297.
Is 52752 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 52752?
52752 is a Harshad number: divisible by its digit sum 21.