The number 81695
81695 is a composite number with 4 divisors. Its prime factorisation is 5 × 16339. Divisors (4): 1, 5, 16339, 81695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 81695: a semiprime: 5 × 16339, the product of two primes.
- 2
81695 is composite. Its prime factorisation is
- 3
The divisors add up to 98040; without 81695 itself that is 16345, so 81695 is deficient (16345 is less than 81695). Euler's totient φ(81695) = 65352 numbers up to 81695 share no factor with it.
- 4
The digits of 81695 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 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81695 = 5 \times 16339 \]
81695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 98040 |
| Euler totient φ(n) | 65352 |
| Square | 6674073025 |
| Cube | 545238395777375 |
| Square root | 285.823372 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 76 |
| Scientific notation | 8.1695 × |
81695 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand six hundred and ninety-five |
| Binary (base 2) | 10011111100011111 |
| Octal (base 8) | 237437 |
| Hexadecimal (base 16) | 13F1F |
| Base 3 | 11011001202 |
| As time | 81695 seconds = 22 h 41 min 35 s |
Is 81695 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 | Yes (81695 ÷ 5 = 16339) | 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 5) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 81695 a prime number?
No. 81695 = 5 × 16339, so it is divisible by 5.
What are the factors of 81695?
1, 5, 16339, 81695.
What is 81695 in binary?
10011111100011111 (hexadecimal 13F1F, octal 237437).
What is the square root of 81695?
About 285.8234.
Is 81695 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 81695?
81695 is a semiprime: 5 × 16339, the product of two primes.