The number 52832
52832 is a composite number with 24 divisors. Its prime factorisation is × 13 × 127. Divisors (24): 1, 2, 4, 8, 13, 16, 26, 32, 52, 104, 127, 208, 254, 416, 508, 1016 … 52832.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
52832 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
52832 is composite. Its prime factorisation is
- 3
The divisors add up to 112896; without 52832 itself that is 60064, so 52832 is abundant (60064 is more than 52832). Euler's totient φ(52832) = 24192 numbers up to 52832 share no factor with it.
- 4
The digits of 52832 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52832 = 2^{5} \times 13 \times 127 \]52832 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 112896 |
| Euler totient φ(n) | 24192 |
| Square | 2791220224 |
| Cube | 147465746874368 |
| Square root | 229.852126 (= 4√3302) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.2832 × |
52832 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand eight hundred and thirty-two |
| Binary (base 2) | 1100111001100000 |
| Octal (base 8) | 147140 |
| Hexadecimal (base 16) | CE60 |
| Base 3 | 2200110202 |
| As time | 52832 seconds = 14 h 40 min 32 s |
Is 52832 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52832 ÷ 2 = 26416) | 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 (52832 ÷ 4 = 13208) | 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 | No (remainder 3) | 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 (52832 ÷ 8 = 6604) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52832 a prime number?
No. 52832 = × 13 × 127, so it is divisible by 2.
What are the factors of 52832?
1, 2, 4, 8, 13, 16, 26, 32, 52, 104, 127, 208, 254, 416, 508, 1016, 1651, 2032, 3302, 4064, 6604, 13208, 26416, 52832.
What is 52832 in binary?
1100111001100000 (hexadecimal CE60, octal 147140).
What is the square root of 52832?
About 229.8521, exactly 4√3302.
Is 52832 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 52832?
It is a composite number with 24 divisors.