The number 86013
86013 is a composite number with 12 divisors. Its prime factorisation is × 19 × 503. Divisors (12): 1, 3, 9, 19, 57, 171, 503, 1509, 4527, 9557, 28671, 86013.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
86013 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
86013 is composite. Its prime factorisation is
- 3
The divisors add up to 131040; without 86013 itself that is 45027, so 86013 is deficient (45027 is less than 86013). Euler's totient φ(86013) = 54216 numbers up to 86013 share no factor with it.
- 4
The digits of 86013 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 195 steps to reach 1.
LaTeX source of the formulas on this page
\[ 86013 = 3^{2} \times 19 \times 503 \]86013 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 131040 |
| Euler totient φ(n) | 54216 |
| Square | 7398236169 |
| Cube | 636344487604197 |
| Square root | 293.279730 (= 3√9557) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 195 |
| Scientific notation | 8.6013 × |
86013 in other forms
| Form | Value |
|---|---|
| In words | eighty-six thousand and thirteen |
| Binary (base 2) | 10100111111111101 |
| Octal (base 8) | 247775 |
| Hexadecimal (base 16) | 14FFD |
| Base 3 | 11100222200 |
| As time | 86013 seconds = 23 h 53 min 33 s |
Is 86013 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 (86013 ÷ 3 = 28671) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (86013 ÷ 9 = 9557) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 86013 a prime number?
No. 86013 = × 19 × 503, so it is divisible by 3.
What are the factors of 86013?
1, 3, 9, 19, 57, 171, 503, 1509, 4527, 9557, 28671, 86013.
What is 86013 in binary?
10100111111111101 (hexadecimal 14FFD, octal 247775).
What is the square root of 86013?
About 293.2797, exactly 3√9557.
Is 86013 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 86013?
It is a composite number with 12 divisors.