The number 51132
51132 is a composite number with 12 divisors. Its prime factorisation is × 3 × 4261. Divisors (12): 1, 2, 3, 4, 6, 12, 4261, 8522, 12783, 17044, 25566, 51132.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51132: a Harshad number: divisible by its digit sum 12.
- 2
51132 is composite. Its prime factorisation is
- 3
The divisors add up to 119336; without 51132 itself that is 68204, so 51132 is abundant (68204 is more than 51132). Euler's totient φ(51132) = 17040 numbers up to 51132 share no factor with it.
- 4
The digits of 51132 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 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51132 = 2^{2} \times 3 \times 4261 \]51132 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 119336 |
| Euler totient φ(n) | 17040 |
| Square | 2614481424 |
| Cube | 133683664171968 |
| Square root | 226.123860 (= 2√12783) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.1132 × |
51132 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand one hundred and thirty-two |
| Binary (base 2) | 1100011110111100 |
| Octal (base 8) | 143674 |
| Hexadecimal (base 16) | C7BC |
| Base 3 | 2121010210 |
| As time | 51132 seconds = 14 h 12 min 12 s |
Is 51132 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51132 ÷ 2 = 25566) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (51132 ÷ 3 = 17044) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (51132 ÷ 4 = 12783) | 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 (51132 ÷ 6 = 8522) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 | No (remainder 4) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (51132 ÷ 12 = 4261) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51132 a prime number?
No. 51132 = × 3 × 4261, so it is divisible by 2.
What are the factors of 51132?
1, 2, 3, 4, 6, 12, 4261, 8522, 12783, 17044, 25566, 51132.
What is 51132 in binary?
1100011110111100 (hexadecimal C7BC, octal 143674).
What is the square root of 51132?
About 226.1239, exactly 2√12783.
Is 51132 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 51132?
51132 is a Harshad number: divisible by its digit sum 12.