The number 86059
86059 is a composite number with 4 divisors. Its prime factorisation is 41 × 2099. Divisors (4): 1, 41, 2099, 86059.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 86059: a semiprime: 41 × 2099, the product of two primes.
- 2
86059 is composite. Its prime factorisation is
- 3
The divisors add up to 88200; without 86059 itself that is 2141, so 86059 is deficient (2141 is less than 86059). Euler's totient φ(86059) = 83920 numbers up to 86059 share no factor with it.
- 4
The digits of 86059 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 102 steps to reach 1.
LaTeX source of the formulas on this page
\[ 86059 = 41 \times 2099 \]
86059 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 88200 |
| Euler totient φ(n) | 83920 |
| Square | 7406151481 |
| Cube | 637365990303379 |
| Square root | 293.358143 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 102 |
| Scientific notation | 8.6059 × |
86059 in other forms
| Form | Value |
|---|---|
| In words | eighty-six thousand and fifty-nine |
| Binary (base 2) | 10101000000101011 |
| Octal (base 8) | 250053 |
| Hexadecimal (base 16) | 1502B |
| Base 3 | 11101001101 |
| As time | 86059 seconds = 23 h 54 min 19 s |
Is 86059 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 1) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 86059 a prime number?
No. 86059 = 41 × 2099, so it is divisible by 41.
What are the factors of 86059?
1, 41, 2099, 86059.
What is 86059 in binary?
10101000000101011 (hexadecimal 1502B, octal 250053).
What is the square root of 86059?
About 293.3581.
Is 86059 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 86059?
86059 is a semiprime: 41 × 2099, the product of two primes.