The number 86213
86213 is a composite number with 4 divisors. Its prime factorisation is 73 × 1181. Divisors (4): 1, 73, 1181, 86213.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 86213: a semiprime: 73 × 1181, the product of two primes.
- 2
86213 is composite. Its prime factorisation is
- 3
The divisors add up to 87468; without 86213 itself that is 1255, so 86213 is deficient (1255 is less than 86213). Euler's totient φ(86213) = 84960 numbers up to 86213 share no factor with it.
- 4
The digits of 86213 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 86213 = 73 \times 1181 \]
86213 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 87468 |
| Euler totient φ(n) | 84960 |
| Square | 7432681369 |
| Cube | 640793758865597 |
| Square root | 293.620503 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 151 |
| Scientific notation | 8.6213 × |
86213 in other forms
| Form | Value |
|---|---|
| In words | eighty-six thousand two hundred and thirteen |
| Binary (base 2) | 10101000011000101 |
| Octal (base 8) | 250305 |
| Hexadecimal (base 16) | 150C5 |
| Base 3 | 11101021002 |
| As time | 86213 seconds = 23 h 56 min 53 s |
Is 86213 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 | No (remainder 5) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 86213 a prime number?
No. 86213 = 73 × 1181, so it is divisible by 73.
What are the factors of 86213?
1, 73, 1181, 86213.
What is 86213 in binary?
10101000011000101 (hexadecimal 150C5, octal 250305).
What is the square root of 86213?
About 293.6205.
Is 86213 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 86213?
86213 is a semiprime: 73 × 1181, the product of two primes.