The number 52052
52052 is a composite number with 36 divisors. Its prime factorisation is × 7 × 11 × . Divisors (36): 1, 2, 4, 7, 11, 13, 14, 22, 26, 28, 44, 52, 77, 91, 143, 154 … 52052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52052: a Harshad number: divisible by its digit sum 14.
- 2
52052 is composite. Its prime factorisation is
- 3
The divisors add up to 122976; without 52052 itself that is 70924, so 52052 is abundant (70924 is more than 52052). Euler's totient φ(52052) = 18720 numbers up to 52052 share no factor with it.
- 4
The digits of 52052 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 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52052 = 2^{2} \times 7 \times 11 \times 13^{2} \]52052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 36 |
| Sum of divisors | 122976 |
| Euler totient φ(n) | 18720 |
| Square | 2709410704 |
| Cube | 141030245964608 |
| Square root | 228.149074 (= 26√77) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 47 |
| Scientific notation | 5.2052 × |
52052 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand and fifty-two |
| Binary (base 2) | 1100101101010100 |
| Octal (base 8) | 145524 |
| Hexadecimal (base 16) | CB54 |
| Base 3 | 2122101212 |
| As time | 52052 seconds = 14 h 27 min 32 s |
Is 52052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52052 ÷ 2 = 26026) | 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 (52052 ÷ 4 = 13013) | 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 | Yes (52052 ÷ 7 = 7436) | 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 4) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (52052 ÷ 11 = 4732) | 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 52052 a prime number?
No. 52052 = × 7 × 11 × , so it is divisible by 2.
What are the factors of 52052?
1, 2, 4, 7, 11, 13, 14, 22, 26, 28, 44, 52, 77, 91, 143, 154, 169, 182, 286, 308, 338, 364, 572, 676, 1001, 1183, 1859, 2002, 2366, 3718, 4004, 4732, 7436, 13013, 26026, 52052.
What is 52052 in binary?
1100101101010100 (hexadecimal CB54, octal 145524).
What is the square root of 52052?
About 228.1491, exactly 26√77.
Is 52052 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 52052?
52052 is a Harshad number: divisible by its digit sum 14.