The number 91671
91671 is a composite number with 4 divisors. Its prime factorisation is 3 × 30557. Divisors (4): 1, 3, 30557, 91671.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91671: a semiprime: 3 × 30557, the product of two primes.
- 2
91671 is composite. Its prime factorisation is
- 3
The divisors add up to 122232; without 91671 itself that is 30561, so 91671 is deficient (30561 is less than 91671). Euler's totient φ(91671) = 61112 numbers up to 91671 share no factor with it.
- 4
The digits of 91671 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91671 = 3 \times 30557 \]
91671 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 122232 |
| Euler totient φ(n) | 61112 |
| Square | 8403572241 |
| Cube | 770363870904711 |
| Square root | 302.772192 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.1671 × |
91671 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand six hundred and seventy-one |
| Binary (base 2) | 10110011000010111 |
| Octal (base 8) | 263027 |
| Hexadecimal (base 16) | 16617 |
| Base 3 | 11122202020 |
| As time | 91671 seconds = 25 h 27 min 51 s |
Is 91671 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 | Yes (91671 ÷ 3 = 30557) | 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 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91671 a prime number?
No. 91671 = 3 × 30557, so it is divisible by 3.
What are the factors of 91671?
1, 3, 30557, 91671.
What is 91671 in binary?
10110011000010111 (hexadecimal 16617, octal 263027).
What is the square root of 91671?
About 302.7722.
Is 91671 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 91671?
91671 is a semiprime: 3 × 30557, the product of two primes.