The number 86266
86266 is a composite number with 4 divisors. Its prime factorisation is 2 × 43133. Divisors (4): 1, 2, 43133, 86266.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 86266: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 43133, the product of two primes.
- 2
86266 is composite. Its prime factorisation is
- 3
The divisors add up to 129402; without 86266 itself that is 43136, so 86266 is deficient (43136 is less than 86266). Euler's totient φ(86266) = 43132 numbers up to 86266 share no factor with it.
- 4
The digits of 86266 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 86266 = 2 \times 43133 \]
86266 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 129402 |
| Euler totient φ(n) | 43132 |
| Square | 7441822756 |
| Cube | 641976281869096 |
| Square root | 293.710742 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 151 |
| Scientific notation | 8.6266 × |
86266 in other forms
| Form | Value |
|---|---|
| In words | eighty-six thousand two hundred and sixty-six |
| Binary (base 2) | 10101000011111010 |
| Octal (base 8) | 250372 |
| Hexadecimal (base 16) | 150FA |
| Base 3 | 11101100001 |
| As time | 86266 seconds = 23 h 57 min 46 s |
Is 86266 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (86266 ÷ 2 = 43133) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 5) | 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 2) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 86266 a prime number?
No. 86266 = 2 × 43133, so it is divisible by 2.
What are the factors of 86266?
1, 2, 43133, 86266.
What is 86266 in binary?
10101000011111010 (hexadecimal 150FA, octal 250372).
What is the square root of 86266?
About 293.7107.
Is 86266 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 86266?
86266 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 43133, the product of two primes.