The number 52152
52152 is a composite number with 32 divisors. Its prime factorisation is × 3 × 41 × 53. Divisors (32): 1, 2, 3, 4, 6, 8, 12, 24, 41, 53, 82, 106, 123, 159, 164, 212 … 52152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
52152 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
52152 is composite. Its prime factorisation is
- 3
The divisors add up to 136080; without 52152 itself that is 83928, so 52152 is abundant (83928 is more than 52152). Euler's totient φ(52152) = 16640 numbers up to 52152 share no factor with it.
- 4
The digits of 52152 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 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52152 = 2^{3} \times 3 \times 41 \times 53 \]52152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 136080 |
| Euler totient φ(n) | 16640 |
| Square | 2719831104 |
| Cube | 141844631735808 |
| Square root | 228.368124 (= 2√13038) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.2152 × |
52152 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand one hundred and fifty-two |
| Binary (base 2) | 1100101110111000 |
| Octal (base 8) | 145670 |
| Hexadecimal (base 16) | CBB8 |
| Base 3 | 2122112120 |
| As time | 52152 seconds = 14 h 29 min 12 s |
Is 52152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52152 ÷ 2 = 26076) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (52152 ÷ 3 = 17384) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (52152 ÷ 4 = 13038) | 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 (52152 ÷ 6 = 8692) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 (52152 ÷ 8 = 6519) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (52152 ÷ 12 = 4346) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52152 a prime number?
No. 52152 = × 3 × 41 × 53, so it is divisible by 2.
What are the factors of 52152?
1, 2, 3, 4, 6, 8, 12, 24, 41, 53, 82, 106, 123, 159, 164, 212, 246, 318, 328, 424, 492, 636, 984, 1272, 2173, 4346, 6519, 8692, 13038, 17384, 26076, 52152.
What is 52152 in binary?
1100101110111000 (hexadecimal CBB8, octal 145670).
What is the square root of 52152?
About 228.3681, exactly 2√13038.
Is 52152 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 52152?
It is a composite number with 32 divisors.