The number 86238
86238 is a composite number with 16 divisors. Its prime factorisation is 2 × × 1597. Divisors (16): 1, 2, 3, 6, 9, 18, 27, 54, 1597, 3194, 4791, 9582, 14373, 28746, 43119, 86238.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 86238: a Harshad number: divisible by its digit sum 27.
- 2
86238 is composite. Its prime factorisation is
- 3
The divisors add up to 191760; without 86238 itself that is 105522, so 86238 is abundant (105522 is more than 86238). Euler's totient φ(86238) = 28728 numbers up to 86238 share no factor with it.
- 4
The digits of 86238 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 164 steps to reach 1.
LaTeX source of the formulas on this page
\[ 86238 = 2 \times 3^{3} \times 1597 \]86238 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 191760 |
| Euler totient φ(n) | 28728 |
| Square | 7436992644 |
| Cube | 641351371633272 |
| Square root | 293.663072 (= 3√9582) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 164 |
| Scientific notation | 8.6238 × |
86238 in other forms
| Form | Value |
|---|---|
| In words | eighty-six thousand two hundred and thirty-eight |
| Binary (base 2) | 10101000011011110 |
| Octal (base 8) | 250336 |
| Hexadecimal (base 16) | 150DE |
| Base 3 | 11101022000 |
| As time | 86238 seconds = 23 h 57 min 18 s |
Is 86238 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (86238 ÷ 2 = 43119) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (86238 ÷ 3 = 28746) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (86238 ÷ 6 = 14373) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (86238 ÷ 9 = 9582) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 86238 a prime number?
No. 86238 = 2 × × 1597, so it is divisible by 2.
What are the factors of 86238?
1, 2, 3, 6, 9, 18, 27, 54, 1597, 3194, 4791, 9582, 14373, 28746, 43119, 86238.
What is 86238 in binary?
10101000011011110 (hexadecimal 150DE, octal 250336).
What is the square root of 86238?
About 293.6631, exactly 3√9582.
Is 86238 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 86238?
86238 is a Harshad number: divisible by its digit sum 27.