The number 86036
86036 is a composite number with 12 divisors. Its prime factorisation is × 137 × 157. Divisors (12): 1, 2, 4, 137, 157, 274, 314, 548, 628, 21509, 43018, 86036.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
86036 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
86036 is composite. Its prime factorisation is
- 3
The divisors add up to 152628; without 86036 itself that is 66592, so 86036 is deficient (66592 is less than 86036). Euler's totient φ(86036) = 42432 numbers up to 86036 share no factor with it.
- 4
The digits of 86036 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 86036 = 2^{2} \times 137 \times 157 \]86036 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 152628 |
| Euler totient φ(n) | 42432 |
| Square | 7402193296 |
| Cube | 636855102414656 |
| Square root | 293.318939 (= 2√21509) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 76 |
| Scientific notation | 8.6036 × |
86036 in other forms
| Form | Value |
|---|---|
| In words | eighty-six thousand and thirty-six |
| Binary (base 2) | 10101000000010100 |
| Octal (base 8) | 250024 |
| Hexadecimal (base 16) | 15014 |
| Base 3 | 11101000112 |
| As time | 86036 seconds = 23 h 53 min 56 s |
Is 86036 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (86036 ÷ 2 = 43018) | 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 | Yes (86036 ÷ 4 = 21509) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 86036 a prime number?
No. 86036 = × 137 × 157, so it is divisible by 2.
What are the factors of 86036?
1, 2, 4, 137, 157, 274, 314, 548, 628, 21509, 43018, 86036.
What is 86036 in binary?
10101000000010100 (hexadecimal 15014, octal 250024).
What is the square root of 86036?
About 293.3189, exactly 2√21509.
Is 86036 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 86036?
It is a composite number with 12 divisors.