The number 84078
84078 is a composite number with 24 divisors. Its prime factorisation is 2 × × 173. Divisors (24): 1, 2, 3, 6, 9, 18, 27, 54, 81, 162, 173, 243, 346, 486, 519, 1038 … 84078.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 84078: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 27.
- 2
84078 is composite. Its prime factorisation is
- 3
The divisors add up to 190008; without 84078 itself that is 105930, so 84078 is abundant (105930 is more than 84078). Euler's totient φ(84078) = 27864 numbers up to 84078 share no factor with it.
- 4
The digits of 84078 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 120 steps to reach 1.
LaTeX source of the formulas on this page
\[ 84078 = 2 \times 3^{5} \times 173 \]84078 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 190008 |
| Euler totient φ(n) | 27864 |
| Square | 7069110084 |
| Cube | 594356637642552 |
| Square root | 289.962066 (= 9√1038) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 120 |
| Scientific notation | 8.4078 × |
84078 in other forms
| Form | Value |
|---|---|
| In words | eighty-four thousand and seventy-eight |
| Binary (base 2) | 10100100001101110 |
| Octal (base 8) | 244156 |
| Hexadecimal (base 16) | 1486E |
| Base 3 | 11021100000 |
| As time | 84078 seconds = 23 h 21 min 18 s |
Is 84078 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (84078 ÷ 2 = 42039) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (84078 ÷ 3 = 28026) | 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 (84078 ÷ 6 = 14013) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 (84078 ÷ 9 = 9342) | 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 84078 a prime number?
No. 84078 = 2 × × 173, so it is divisible by 2.
What are the factors of 84078?
1, 2, 3, 6, 9, 18, 27, 54, 81, 162, 173, 243, 346, 486, 519, 1038, 1557, 3114, 4671, 9342, 14013, 28026, 42039, 84078.
What is 84078 in binary?
10100100001101110 (hexadecimal 1486E, octal 244156).
What is the square root of 84078?
About 289.9621, exactly 9√1038.
Is 84078 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 84078?
84078 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 27.