The number 51232
51232 is a composite number with 12 divisors. Its prime factorisation is × 1601. Divisors (12): 1, 2, 4, 8, 16, 32, 1601, 3202, 6404, 12808, 25616, 51232.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51232 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51232 is composite. Its prime factorisation is
- 3
The divisors add up to 100926; without 51232 itself that is 49694, so 51232 is deficient (49694 is less than 51232). Euler's totient φ(51232) = 25600 numbers up to 51232 share no factor with it.
- 4
The digits of 51232 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51232 = 2^{5} \times 1601 \]51232 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 100926 |
| Euler totient φ(n) | 25600 |
| Square | 2624717824 |
| Cube | 134469543559168 |
| Square root | 226.344870 (= 4√3202) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.1232 × |
51232 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand two hundred and thirty-two |
| Binary (base 2) | 1100100000100000 |
| Octal (base 8) | 144040 |
| Hexadecimal (base 16) | C820 |
| Base 3 | 2121021111 |
| As time | 51232 seconds = 14 h 13 min 52 s |
Is 51232 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51232 ÷ 2 = 25616) | 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 (51232 ÷ 4 = 12808) | 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 | 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 | Yes (51232 ÷ 8 = 6404) | 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 5) | 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 51232 a prime number?
No. 51232 = × 1601, so it is divisible by 2.
What are the factors of 51232?
1, 2, 4, 8, 16, 32, 1601, 3202, 6404, 12808, 25616, 51232.
What is 51232 in binary?
1100100000100000 (hexadecimal C820, octal 144040).
What is the square root of 51232?
About 226.3449, exactly 4√3202.
Is 51232 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 51232?
It is a composite number with 12 divisors.