The number 52032
52032 is a composite number with 28 divisors. Its prime factorisation is × 3 × 271. Divisors (28): 1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 192, 271, 542 … 52032.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52032: a Harshad number: divisible by its digit sum 12.
- 2
52032 is composite. Its prime factorisation is
- 3
The divisors add up to 138176; without 52032 itself that is 86144, so 52032 is abundant (86144 is more than 52032). Euler's totient φ(52032) = 17280 numbers up to 52032 share no factor with it.
- 4
The digits of 52032 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52032 = 2^{6} \times 3 \times 271 \]52032 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 28 |
| Sum of divisors | 138176 |
| Euler totient φ(n) | 17280 |
| Square | 2707329024 |
| Cube | 140867743776768 |
| Square root | 228.105239 (= 8√813) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 47 |
| Scientific notation | 5.2032 × |
52032 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand and thirty-two |
| Binary (base 2) | 1100101101000000 |
| Octal (base 8) | 145500 |
| Hexadecimal (base 16) | CB40 |
| Base 3 | 2122101010 |
| As time | 52032 seconds = 14 h 27 min 12 s |
Is 52032 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52032 ÷ 2 = 26016) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (52032 ÷ 3 = 17344) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (52032 ÷ 4 = 13008) | 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 (52032 ÷ 6 = 8672) | 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 (52032 ÷ 8 = 6504) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (52032 ÷ 12 = 4336) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52032 a prime number?
No. 52032 = × 3 × 271, so it is divisible by 2.
What are the factors of 52032?
1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 192, 271, 542, 813, 1084, 1626, 2168, 3252, 4336, 6504, 8672, 13008, 17344, 26016, 52032.
What is 52032 in binary?
1100101101000000 (hexadecimal CB40, octal 145500).
What is the square root of 52032?
About 228.1052, exactly 8√813.
Is 52032 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 52032?
52032 is a Harshad number: divisible by its digit sum 12.