The number 51032
51032 is a composite number with 8 divisors. Its prime factorisation is × 6379. Divisors (8): 1, 2, 4, 8, 6379, 12758, 25516, 51032.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51032 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51032 is composite. Its prime factorisation is
- 3
The divisors add up to 95700; without 51032 itself that is 44668, so 51032 is deficient (44668 is less than 51032). Euler's totient φ(51032) = 25512 numbers up to 51032 share no factor with it.
- 4
The digits of 51032 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51032 = 2^{3} \times 6379 \]51032 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 95700 |
| Euler totient φ(n) | 25512 |
| Square | 2604265024 |
| Cube | 132900852704768 |
| Square root | 225.902634 (= 2√12758) |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 83 |
| Scientific notation | 5.1032 × |
51032 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and thirty-two |
| Binary (base 2) | 1100011101011000 |
| Octal (base 8) | 143530 |
| Hexadecimal (base 16) | C758 |
| Base 3 | 2121000002 |
| As time | 51032 seconds = 14 h 10 min 32 s |
Is 51032 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51032 ÷ 2 = 25516) | 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 (51032 ÷ 4 = 12758) | 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 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 (51032 ÷ 8 = 6379) | 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 3) | 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 51032 a prime number?
No. 51032 = × 6379, so it is divisible by 2.
What are the factors of 51032?
1, 2, 4, 8, 6379, 12758, 25516, 51032.
What is 51032 in binary?
1100011101011000 (hexadecimal C758, octal 143530).
What is the square root of 51032?
About 225.9026, exactly 2√12758.
Is 51032 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 51032?
It is a composite number with 8 divisors.