The number 86231
86231 is a composite number with 4 divisors. Its prime factorisation is 53 × 1627. Divisors (4): 1, 53, 1627, 86231.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 86231: a semiprime: 53 × 1627, the product of two primes.
- 2
86231 is composite. Its prime factorisation is
- 3
The divisors add up to 87912; without 86231 itself that is 1681, so 86231 is deficient (1681 is less than 86231). Euler's totient φ(86231) = 84552 numbers up to 86231 share no factor with it.
- 4
The digits of 86231 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
\[ 86231 = 53 \times 1627 \]
86231 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 87912 |
| Euler totient φ(n) | 84552 |
| Square | 7435785361 |
| Cube | 641195207464391 |
| Square root | 293.651154 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 151 |
| Scientific notation | 8.6231 × |
86231 in other forms
| Form | Value |
|---|---|
| In words | eighty-six thousand two hundred and thirty-one |
| Binary (base 2) | 10101000011010111 |
| Octal (base 8) | 250327 |
| Hexadecimal (base 16) | 150D7 |
| Base 3 | 11101021202 |
| As time | 86231 seconds = 23 h 57 min 11 s |
Is 86231 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 3) | 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 5) | 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 7) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 86231 a prime number?
No. 86231 = 53 × 1627, so it is divisible by 53.
What are the factors of 86231?
1, 53, 1627, 86231.
What is 86231 in binary?
10101000011010111 (hexadecimal 150D7, octal 250327).
What is the square root of 86231?
About 293.6512.
Is 86231 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 86231?
86231 is a semiprime: 53 × 1627, the product of two primes.