The number 91741
91741 is a composite number with 4 divisors. Its prime factorisation is 13 × 7057. Divisors (4): 1, 13, 7057, 91741.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91741: a semiprime: 13 × 7057, the product of two primes.
- 2
91741 is composite. Its prime factorisation is
- 3
The divisors add up to 98812; without 91741 itself that is 7071, so 91741 is deficient (7071 is less than 91741). Euler's totient φ(91741) = 84672 numbers up to 91741 share no factor with it.
- 4
The digits of 91741 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91741 = 13 \times 7057 \]
91741 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 98812 |
| Euler totient φ(n) | 84672 |
| Square | 8416411081 |
| Cube | 772129968982021 |
| Square root | 302.887768 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 71 |
| Scientific notation | 9.1741 × |
91741 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand seven hundred and forty-one |
| Binary (base 2) | 10110011001011101 |
| Octal (base 8) | 263135 |
| Hexadecimal (base 16) | 1665D |
| Base 3 | 11122211211 |
| As time | 91741 seconds = 25 h 29 min 1 s |
Is 91741 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 6) | 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 | No (remainder 4) | 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 1) | 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 91741 a prime number?
No. 91741 = 13 × 7057, so it is divisible by 13.
What are the factors of 91741?
1, 13, 7057, 91741.
What is 91741 in binary?
10110011001011101 (hexadecimal 1665D, octal 263135).
What is the square root of 91741?
About 302.8878.
Is 91741 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 91741?
91741 is a semiprime: 13 × 7057, the product of two primes.