The number 51312
51312 is a composite number with 20 divisors. Its prime factorisation is × 3 × 1069. Divisors (20): 1, 2, 3, 4, 6, 8, 12, 16, 24, 48, 1069, 2138, 3207, 4276, 6414, 8552 … 51312.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51312: a Harshad number: divisible by its digit sum 12.
- 2
51312 is composite. Its prime factorisation is
- 3
The divisors add up to 132680; without 51312 itself that is 81368, so 51312 is abundant (81368 is more than 51312). Euler's totient φ(51312) = 17088 numbers up to 51312 share no factor with it.
- 4
The digits of 51312 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 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51312 = 2^{4} \times 3 \times 1069 \]51312 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 132680 |
| Euler totient φ(n) | 17088 |
| Square | 2632921344 |
| Cube | 135100460003328 |
| Square root | 226.521522 (= 4√3207) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.1312 × |
51312 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand three hundred and twelve |
| Binary (base 2) | 1100100001110000 |
| Octal (base 8) | 144160 |
| Hexadecimal (base 16) | C870 |
| Base 3 | 2121101110 |
| As time | 51312 seconds = 14 h 15 min 12 s |
Is 51312 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51312 ÷ 2 = 25656) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (51312 ÷ 3 = 17104) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (51312 ÷ 4 = 12828) | 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 (51312 ÷ 6 = 8552) | 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 (51312 ÷ 8 = 6414) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (51312 ÷ 12 = 4276) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51312 a prime number?
No. 51312 = × 3 × 1069, so it is divisible by 2.
What are the factors of 51312?
1, 2, 3, 4, 6, 8, 12, 16, 24, 48, 1069, 2138, 3207, 4276, 6414, 8552, 12828, 17104, 25656, 51312.
What is 51312 in binary?
1100100001110000 (hexadecimal C870, octal 144160).
What is the square root of 51312?
About 226.5215, exactly 4√3207.
Is 51312 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 51312?
51312 is a Harshad number: divisible by its digit sum 12.