The number 84052
84052 is a composite number with 6 divisors. Its prime factorisation is × 21013. Divisors (6): 1, 2, 4, 21013, 42026, 84052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 84052: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
84052 is composite. Its prime factorisation is
- 3
The divisors add up to 147098; without 84052 itself that is 63046, so 84052 is deficient (63046 is less than 84052). Euler's totient φ(84052) = 42024 numbers up to 84052 share no factor with it.
- 4
The digits of 84052 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 32 steps to reach 1.
LaTeX source of the formulas on this page
\[ 84052 = 2^{2} \times 21013 \]84052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 147098 |
| Euler totient φ(n) | 42024 |
| Square | 7064738704 |
| Cube | 593805417548608 |
| Square root | 289.917230 (= 2√21013) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 32 |
| Scientific notation | 8.4052 × |
84052 in other forms
| Form | Value |
|---|---|
| In words | eighty-four thousand and fifty-two |
| Binary (base 2) | 10100100001010100 |
| Octal (base 8) | 244124 |
| Hexadecimal (base 16) | 14854 |
| Base 3 | 11021022001 |
| As time | 84052 seconds = 23 h 20 min 52 s |
Is 84052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (84052 ÷ 2 = 42026) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (84052 ÷ 4 = 21013) | 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 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 84052 a prime number?
No. 84052 = × 21013, so it is divisible by 2.
What are the factors of 84052?
1, 2, 4, 21013, 42026, 84052.
What is 84052 in binary?
10100100001010100 (hexadecimal 14854, octal 244124).
What is the square root of 84052?
About 289.9172, exactly 2√21013.
Is 84052 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 84052?
84052 is a happy number: repeatedly adding the squares of its digits reaches 1.