The number 91681
91681 is a composite number with 4 divisors. Its prime factorisation is 17 × 5393. Divisors (4): 1, 17, 5393, 91681.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91681: a semiprime: 17 × 5393, the product of two primes.
- 2
91681 is composite. Its prime factorisation is
- 3
The divisors add up to 97092; without 91681 itself that is 5411, so 91681 is deficient (5411 is less than 91681). Euler's totient φ(91681) = 86272 numbers up to 91681 share no factor with it.
- 4
The digits of 91681 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 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91681 = 17 \times 5393 \]
91681 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 97092 |
| Euler totient φ(n) | 86272 |
| Square | 8405405761 |
| Cube | 770616005574241 |
| Square root | 302.788705 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.1681 × |
91681 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand six hundred and eighty-one |
| Binary (base 2) | 10110011000100001 |
| Octal (base 8) | 263041 |
| Hexadecimal (base 16) | 16621 |
| Base 3 | 11122202121 |
| As time | 91681 seconds = 25 h 28 min 1 s |
Is 91681 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 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 1) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91681 a prime number?
No. 91681 = 17 × 5393, so it is divisible by 17.
What are the factors of 91681?
1, 17, 5393, 91681.
What is 91681 in binary?
10110011000100001 (hexadecimal 16621, octal 263041).
What is the square root of 91681?
About 302.7887.
Is 91681 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 91681?
91681 is a semiprime: 17 × 5393, the product of two primes.