The number 51078
51078 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 8513. Divisors (8): 1, 2, 3, 6, 8513, 17026, 25539, 51078.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51078: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
51078 is composite. Its prime factorisation is
- 3
The divisors add up to 102168; without 51078 itself that is 51090, so 51078 is abundant (51090 is more than 51078). Euler's totient φ(51078) = 17024 numbers up to 51078 share no factor with it.
- 4
The digits of 51078 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51078 = 2 \times 3 \times 8513 \]
51078 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 102168 |
| Euler totient φ(n) | 17024 |
| Square | 2608962084 |
| Cube | 133260565326552 |
| Square root | 226.004425 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.1078 × |
51078 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and seventy-eight |
| Binary (base 2) | 1100011110000110 |
| Octal (base 8) | 143606 |
| Hexadecimal (base 16) | C786 |
| Base 3 | 2121001210 |
| As time | 51078 seconds = 14 h 11 min 18 s |
Is 51078 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51078 ÷ 2 = 25539) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (51078 ÷ 3 = 17026) | 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 (51078 ÷ 6 = 8513) | 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 | No (remainder 6) | 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 8) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51078 a prime number?
No. 51078 = 2 × 3 × 8513, so it is divisible by 2.
What are the factors of 51078?
1, 2, 3, 6, 8513, 17026, 25539, 51078.
What is 51078 in binary?
1100011110000110 (hexadecimal C786, octal 143606).
What is the square root of 51078?
About 226.0044.
Is 51078 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 51078?
51078 is a happy number: repeatedly adding the squares of its digits reaches 1.