The number 51678
51678 is a composite number with 40 divisors. Its prime factorisation is 2 × × 11 × 29. Divisors (40): 1, 2, 3, 6, 9, 11, 18, 22, 27, 29, 33, 54, 58, 66, 81, 87 … 51678.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51678: a Harshad number: divisible by its digit sum 27.
- 2
51678 is composite. Its prime factorisation is
- 3
The divisors add up to 130680; without 51678 itself that is 79002, so 51678 is abundant (79002 is more than 51678). Euler's totient φ(51678) = 15120 numbers up to 51678 share no factor with it.
- 4
The digits of 51678 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51678 = 2 \times 3^{4} \times 11 \times 29 \]51678 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 40 |
| Sum of divisors | 130680 |
| Euler totient φ(n) | 15120 |
| Square | 2670615684 |
| Cube | 138012077317752 |
| Square root | 227.327957 (= 9√638) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.1678 × |
51678 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand six hundred and seventy-eight |
| Binary (base 2) | 1100100111011110 |
| Octal (base 8) | 144736 |
| Hexadecimal (base 16) | C9DE |
| Base 3 | 2121220000 |
| As time | 51678 seconds = 14 h 21 min 18 s |
Is 51678 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51678 ÷ 2 = 25839) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (51678 ÷ 3 = 17226) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (51678 ÷ 6 = 8613) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (51678 ÷ 9 = 5742) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (51678 ÷ 11 = 4698) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51678 a prime number?
No. 51678 = 2 × × 11 × 29, so it is divisible by 2.
What are the factors of 51678?
1, 2, 3, 6, 9, 11, 18, 22, 27, 29, 33, 54, 58, 66, 81, 87, 99, 162, 174, 198, 261, 297, 319, 522, 594, 638, 783, 891, 957, 1566, 1782, 1914, 2349, 2871, 4698, 5742, 8613, 17226, 25839, 51678.
What is 51678 in binary?
1100100111011110 (hexadecimal C9DE, octal 144736).
What is the square root of 51678?
About 227.3280, exactly 9√638.
Is 51678 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 51678?
51678 is a Harshad number: divisible by its digit sum 27.