The number 91271
91271 is a composite number with 4 divisors. Its prime factorisation is 107 × 853. Divisors (4): 1, 107, 853, 91271.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91271: a semiprime: 107 × 853, the product of two primes.
- 2
91271 is composite. Its prime factorisation is
- 3
The divisors add up to 92232; without 91271 itself that is 961, so 91271 is deficient (961 is less than 91271). Euler's totient φ(91271) = 90312 numbers up to 91271 share no factor with it.
- 4
The digits of 91271 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91271 = 107 \times 853 \]
91271 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 92232 |
| Euler totient φ(n) | 90312 |
| Square | 8330395441 |
| Cube | 760323522295511 |
| Square root | 302.110907 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.1271 × |
91271 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand two hundred and seventy-one |
| Binary (base 2) | 10110010010000111 |
| Octal (base 8) | 262207 |
| Hexadecimal (base 16) | 16487 |
| Base 3 | 11122012102 |
| As time | 91271 seconds = 25 h 21 min 11 s |
Is 91271 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 | No (remainder 1) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 91271 a prime number?
No. 91271 = 107 × 853, so it is divisible by 107.
What are the factors of 91271?
1, 107, 853, 91271.
What is 91271 in binary?
10110010010000111 (hexadecimal 16487, octal 262207).
What is the square root of 91271?
About 302.1109.
Is 91271 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 91271?
91271 is a semiprime: 107 × 853, the product of two primes.