The number 82701
82701 is a composite number with 10 divisors. Its prime factorisation is × 1021. Divisors (10): 1, 3, 9, 27, 81, 1021, 3063, 9189, 27567, 82701.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
82701 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
82701 is composite. Its prime factorisation is
- 3
The divisors add up to 123662; without 82701 itself that is 40961, so 82701 is deficient (40961 is less than 82701). Euler's totient φ(82701) = 55080 numbers up to 82701 share no factor with it.
- 4
The digits of 82701 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 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 82701 = 3^{4} \times 1021 \]82701 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 123662 |
| Euler totient φ(n) | 55080 |
| Square | 6839455401 |
| Cube | 565629801118101 |
| Square root | 287.577816 (= 9√1021) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 151 |
| Scientific notation | 8.2701 × |
82701 in other forms
| Form | Value |
|---|---|
| In words | eighty-two thousand seven hundred and one |
| Binary (base 2) | 10100001100001101 |
| Octal (base 8) | 241415 |
| Hexadecimal (base 16) | 1430D |
| Base 3 | 11012110000 |
| As time | 82701 seconds = 22 h 58 min 21 s |
Is 82701 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 (82701 ÷ 3 = 27567) | 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 1) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (82701 ÷ 9 = 9189) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 82701 a prime number?
No. 82701 = × 1021, so it is divisible by 3.
What are the factors of 82701?
1, 3, 9, 27, 81, 1021, 3063, 9189, 27567, 82701.
What is 82701 in binary?
10100001100001101 (hexadecimal 1430D, octal 241415).
What is the square root of 82701?
About 287.5778, exactly 9√1021.
Is 82701 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 82701?
It is a composite number with 10 divisors.