The number 69078
69078 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 29 × 397. Divisors (16): 1, 2, 3, 6, 29, 58, 87, 174, 397, 794, 1191, 2382, 11513, 23026, 34539, 69078.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69078: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
69078 is composite. Its prime factorisation is
- 3
The divisors add up to 143280; without 69078 itself that is 74202, so 69078 is abundant (74202 is more than 69078). Euler's totient φ(69078) = 22176 numbers up to 69078 share no factor with it.
- 4
The digits of 69078 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69078 = 2 \times 3 \times 29 \times 397 \]
69078 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 143280 |
| Euler totient φ(n) | 22176 |
| Square | 4771770084 |
| Cube | 329624333862552 |
| Square root | 262.826939 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 68 |
| Scientific notation | 6.9078 × |
69078 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand and seventy-eight |
| Binary (base 2) | 10000110111010110 |
| Octal (base 8) | 206726 |
| Hexadecimal (base 16) | 10DD6 |
| Base 3 | 10111202110 |
| As time | 69078 seconds = 19 h 11 min 18 s |
Is 69078 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69078 ÷ 2 = 34539) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (69078 ÷ 3 = 23026) | 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 (69078 ÷ 6 = 11513) | 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 | 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 9) | 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 69078 a prime number?
No. 69078 = 2 × 3 × 29 × 397, so it is divisible by 2.
What are the factors of 69078?
1, 2, 3, 6, 29, 58, 87, 174, 397, 794, 1191, 2382, 11513, 23026, 34539, 69078.
What is 69078 in binary?
10000110111010110 (hexadecimal 10DD6, octal 206726).
What is the square root of 69078?
About 262.8269.
Is 69078 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 69078?
69078 is a happy number: repeatedly adding the squares of its digits reaches 1.