The number 86159
86159 is a composite number with 4 divisors. Its prime factorisation is 29 × 2971. Divisors (4): 1, 29, 2971, 86159.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 86159: a Harshad number: divisible by its digit sum 29; a semiprime: 29 × 2971, the product of two primes.
- 2
86159 is composite. Its prime factorisation is
- 3
The divisors add up to 89160; without 86159 itself that is 3001, so 86159 is deficient (3001 is less than 86159). Euler's totient φ(86159) = 83160 numbers up to 86159 share no factor with it.
- 4
The digits of 86159 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 195 steps to reach 1.
LaTeX source of the formulas on this page
\[ 86159 = 29 \times 2971 \]
86159 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 89160 |
| Euler totient φ(n) | 83160 |
| Square | 7423373281 |
| Cube | 639590418517679 |
| Square root | 293.528534 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 195 |
| Scientific notation | 8.6159 × |
86159 in other forms
| Form | Value |
|---|---|
| In words | eighty-six thousand one hundred and fifty-nine |
| Binary (base 2) | 10101000010001111 |
| Octal (base 8) | 250217 |
| Hexadecimal (base 16) | 1508F |
| Base 3 | 11101012002 |
| As time | 86159 seconds = 23 h 55 min 59 s |
Is 86159 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 4) | 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 3) | 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 9) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 86159 a prime number?
No. 86159 = 29 × 2971, so it is divisible by 29.
What are the factors of 86159?
1, 29, 2971, 86159.
What is 86159 in binary?
10101000010001111 (hexadecimal 1508F, octal 250217).
What is the square root of 86159?
About 293.5285.
Is 86159 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 86159?
86159 is a Harshad number: divisible by its digit sum 29; a semiprime: 29 × 2971, the product of two primes.