The number 81691
81691 is a composite number with 4 divisors. Its prime factorisation is 151 × 541. Divisors (4): 1, 151, 541, 81691.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 81691: a semiprime: 151 × 541, the product of two primes.
- 2
81691 is composite. Its prime factorisation is
- 3
The divisors add up to 82384; without 81691 itself that is 693, so 81691 is deficient (693 is less than 81691). Euler's totient φ(81691) = 81000 numbers up to 81691 share no factor with it.
- 4
The digits of 81691 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 94 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81691 = 151 \times 541 \]
81691 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 82384 |
| Euler totient φ(n) | 81000 |
| Square | 6673419481 |
| Cube | 545158310822371 |
| Square root | 285.816375 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 94 |
| Scientific notation | 8.1691 × |
81691 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand six hundred and ninety-one |
| Binary (base 2) | 10011111100011011 |
| Octal (base 8) | 237433 |
| Hexadecimal (base 16) | 13F1B |
| Base 3 | 11011001121 |
| As time | 81691 seconds = 22 h 41 min 31 s |
Is 81691 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 1) | 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 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81691 a prime number?
No. 81691 = 151 × 541, so it is divisible by 151.
What are the factors of 81691?
1, 151, 541, 81691.
What is 81691 in binary?
10011111100011011 (hexadecimal 13F1B, octal 237433).
What is the square root of 81691?
About 285.8164.
Is 81691 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 81691?
81691 is a semiprime: 151 × 541, the product of two primes.