The number 53052
53052 is a composite number with 12 divisors. Its prime factorisation is × 3 × 4421. Divisors (12): 1, 2, 3, 4, 6, 12, 4421, 8842, 13263, 17684, 26526, 53052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53052 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53052 is composite. Its prime factorisation is
- 3
The divisors add up to 123816; without 53052 itself that is 70764, so 53052 is abundant (70764 is more than 53052). Euler's totient φ(53052) = 17680 numbers up to 53052 share no factor with it.
- 4
The digits of 53052 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53052 = 2^{2} \times 3 \times 4421 \]53052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 123816 |
| Euler totient φ(n) | 17680 |
| Square | 2814514704 |
| Cube | 149315634076608 |
| Square root | 230.330198 (= 2√13263) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.3052 × |
53052 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand and fifty-two |
| Binary (base 2) | 1100111100111100 |
| Octal (base 8) | 147474 |
| Hexadecimal (base 16) | CF3C |
| Base 3 | 2200202220 |
| As time | 53052 seconds = 14 h 44 min 12 s |
Is 53052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53052 ÷ 2 = 26526) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (53052 ÷ 3 = 17684) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (53052 ÷ 4 = 13263) | 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 (53052 ÷ 6 = 8842) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (53052 ÷ 12 = 4421) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53052 a prime number?
No. 53052 = × 3 × 4421, so it is divisible by 2.
What are the factors of 53052?
1, 2, 3, 4, 6, 12, 4421, 8842, 13263, 17684, 26526, 53052.
What is 53052 in binary?
1100111100111100 (hexadecimal CF3C, octal 147474).
What is the square root of 53052?
About 230.3302, exactly 2√13263.
Is 53052 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 53052?
It is a composite number with 12 divisors.