The number 86295
86295 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 11 × 523. Divisors (16): 1, 3, 5, 11, 15, 33, 55, 165, 523, 1569, 2615, 5753, 7845, 17259, 28765, 86295.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
86295 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
86295 is composite. Its prime factorisation is
- 3
The divisors add up to 150912; without 86295 itself that is 64617, so 86295 is deficient (64617 is less than 86295). Euler's totient φ(86295) = 41760 numbers up to 86295 share no factor with it.
- 4
The digits of 86295 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 257 steps to reach 1.
LaTeX source of the formulas on this page
\[ 86295 = 3 \times 5 \times 11 \times 523 \]
86295 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 150912 |
| Euler totient φ(n) | 41760 |
| Square | 7446827025 |
| Cube | 642623938122375 |
| Square root | 293.760106 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 257 |
| Scientific notation | 8.6295 × |
86295 in other forms
| Form | Value |
|---|---|
| In words | eighty-six thousand two hundred and ninety-five |
| Binary (base 2) | 10101000100010111 |
| Octal (base 8) | 250427 |
| Hexadecimal (base 16) | 15117 |
| Base 3 | 11101101010 |
| As time | 86295 seconds = 23 h 58 min 15 s |
Is 86295 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 | Yes (86295 ÷ 3 = 28765) | 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 | Yes (86295 ÷ 5 = 17259) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (86295 ÷ 11 = 7845) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 86295 a prime number?
No. 86295 = 3 × 5 × 11 × 523, so it is divisible by 3.
What are the factors of 86295?
1, 3, 5, 11, 15, 33, 55, 165, 523, 1569, 2615, 5753, 7845, 17259, 28765, 86295.
What is 86295 in binary?
10101000100010111 (hexadecimal 15117, octal 250427).
What is the square root of 86295?
About 293.7601.
Is 86295 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 86295?
It is a composite number with 16 divisors.