The number 86258
86258 is a composite number with 16 divisors. Its prime factorisation is 2 × 17 × 43 × 59. Divisors (16): 1, 2, 17, 34, 43, 59, 86, 118, 731, 1003, 1462, 2006, 2537, 5074, 43129, 86258.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 86258: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
86258 is composite. Its prime factorisation is
- 3
The divisors add up to 142560; without 86258 itself that is 56302, so 86258 is deficient (56302 is less than 86258). Euler's totient φ(86258) = 38976 numbers up to 86258 share no factor with it.
- 4
The digits of 86258 add up to 29, 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
\[ 86258 = 2 \times 17 \times 43 \times 59 \]
86258 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 142560 |
| Euler totient φ(n) | 38976 |
| Square | 7440442564 |
| Cube | 641797694685512 |
| Square root | 293.697123 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 151 |
| Scientific notation | 8.6258 × |
86258 in other forms
| Form | Value |
|---|---|
| In words | eighty-six thousand two hundred and fifty-eight |
| Binary (base 2) | 10101000011110010 |
| Octal (base 8) | 250362 |
| Hexadecimal (base 16) | 150F2 |
| Base 3 | 11101022202 |
| As time | 86258 seconds = 23 h 57 min 38 s |
Is 86258 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (86258 ÷ 2 = 43129) | 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 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 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 2) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 86258 a prime number?
No. 86258 = 2 × 17 × 43 × 59, so it is divisible by 2.
What are the factors of 86258?
1, 2, 17, 34, 43, 59, 86, 118, 731, 1003, 1462, 2006, 2537, 5074, 43129, 86258.
What is 86258 in binary?
10101000011110010 (hexadecimal 150F2, octal 250362).
What is the square root of 86258?
About 293.6971.
Is 86258 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 86258?
86258 is a happy number: repeatedly adding the squares of its digits reaches 1.