The number 53032
53032 is a composite number with 16 divisors. Its prime factorisation is × 7 × 947. Divisors (16): 1, 2, 4, 7, 8, 14, 28, 56, 947, 1894, 3788, 6629, 7576, 13258, 26516, 53032.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53032 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53032 is composite. Its prime factorisation is
- 3
The divisors add up to 113760; without 53032 itself that is 60728, so 53032 is abundant (60728 is more than 53032). Euler's totient φ(53032) = 22704 numbers up to 53032 share no factor with it.
- 4
The digits of 53032 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53032 = 2^{3} \times 7 \times 947 \]53032 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 113760 |
| Euler totient φ(n) | 22704 |
| Square | 2812393024 |
| Cube | 149146826848768 |
| Square root | 230.286778 (= 2√13258) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.3032 × |
53032 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand and thirty-two |
| Binary (base 2) | 1100111100101000 |
| Octal (base 8) | 147450 |
| Hexadecimal (base 16) | CF28 |
| Base 3 | 2200202011 |
| As time | 53032 seconds = 14 h 43 min 52 s |
Is 53032 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53032 ÷ 2 = 26516) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (53032 ÷ 4 = 13258) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (53032 ÷ 7 = 7576) | 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 (53032 ÷ 8 = 6629) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53032 a prime number?
No. 53032 = × 7 × 947, so it is divisible by 2.
What are the factors of 53032?
1, 2, 4, 7, 8, 14, 28, 56, 947, 1894, 3788, 6629, 7576, 13258, 26516, 53032.
What is 53032 in binary?
1100111100101000 (hexadecimal CF28, octal 147450).
What is the square root of 53032?
About 230.2868, exactly 2√13258.
Is 53032 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 53032?
It is a composite number with 16 divisors.