The number 86052
86052 is a composite number with 24 divisors. Its prime factorisation is × 3 × 71 × 101. Divisors (24): 1, 2, 3, 4, 6, 12, 71, 101, 142, 202, 213, 284, 303, 404, 426, 606 … 86052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 86052: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
86052 is composite. Its prime factorisation is
- 3
The divisors add up to 205632; without 86052 itself that is 119580, so 86052 is abundant (119580 is more than 86052). Euler's totient φ(86052) = 28000 numbers up to 86052 share no factor with it.
- 4
The digits of 86052 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 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 86052 = 2^{2} \times 3 \times 71 \times 101 \]86052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 205632 |
| Euler totient φ(n) | 28000 |
| Square | 7404946704 |
| Cube | 637210473772608 |
| Square root | 293.346212 (= 2√21513) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 76 |
| Scientific notation | 8.6052 × |
86052 in other forms
| Form | Value |
|---|---|
| In words | eighty-six thousand and fifty-two |
| Binary (base 2) | 10101000000100100 |
| Octal (base 8) | 250044 |
| Hexadecimal (base 16) | 15024 |
| Base 3 | 11101001010 |
| As time | 86052 seconds = 23 h 54 min 12 s |
Is 86052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (86052 ÷ 2 = 43026) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (86052 ÷ 3 = 28684) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (86052 ÷ 4 = 21513) | 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 | Yes (86052 ÷ 6 = 14342) | 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 4) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (86052 ÷ 12 = 7171) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 86052 a prime number?
No. 86052 = × 3 × 71 × 101, so it is divisible by 2.
What are the factors of 86052?
1, 2, 3, 4, 6, 12, 71, 101, 142, 202, 213, 284, 303, 404, 426, 606, 852, 1212, 7171, 14342, 21513, 28684, 43026, 86052.
What is 86052 in binary?
10101000000100100 (hexadecimal 15024, octal 250044).
What is the square root of 86052?
About 293.3462, exactly 2√21513.
Is 86052 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 86052?
86052 is a happy number: repeatedly adding the squares of its digits reaches 1.