The number 82695
82695 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 37 × 149. Divisors (16): 1, 3, 5, 15, 37, 111, 149, 185, 447, 555, 745, 2235, 5513, 16539, 27565, 82695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
82695 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
82695 is composite. Its prime factorisation is
- 3
The divisors add up to 136800; without 82695 itself that is 54105, so 82695 is deficient (54105 is less than 82695). Euler's totient φ(82695) = 42624 numbers up to 82695 share no factor with it.
- 4
The digits of 82695 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 138 steps to reach 1.
LaTeX source of the formulas on this page
\[ 82695 = 3 \times 5 \times 37 \times 149 \]
82695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 136800 |
| Euler totient φ(n) | 42624 |
| Square | 6838463025 |
| Cube | 565506699852375 |
| Square root | 287.567383 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 138 |
| Scientific notation | 8.2695 × |
82695 in other forms
| Form | Value |
|---|---|
| In words | eighty-two thousand six hundred and ninety-five |
| Binary (base 2) | 10100001100000111 |
| Octal (base 8) | 241407 |
| Hexadecimal (base 16) | 14307 |
| Base 3 | 11012102210 |
| As time | 82695 seconds = 22 h 58 min 15 s |
Is 82695 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 (82695 ÷ 3 = 27565) | 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 | Yes (82695 ÷ 5 = 16539) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 82695 a prime number?
No. 82695 = 3 × 5 × 37 × 149, so it is divisible by 3.
What are the factors of 82695?
1, 3, 5, 15, 37, 111, 149, 185, 447, 555, 745, 2235, 5513, 16539, 27565, 82695.
What is 82695 in binary?
10100001100000111 (hexadecimal 14307, octal 241407).
What is the square root of 82695?
About 287.5674.
Is 82695 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 82695?
It is a composite number with 16 divisors.