The number 91371
91371 is a composite number with 16 divisors. Its prime factorisation is 3 × 7 × 19 × 229. Divisors (16): 1, 3, 7, 19, 21, 57, 133, 229, 399, 687, 1603, 4351, 4809, 13053, 30457, 91371.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91371: a Harshad number: divisible by its digit sum 21.
- 2
91371 is composite. Its prime factorisation is
- 3
The divisors add up to 147200; without 91371 itself that is 55829, so 91371 is deficient (55829 is less than 91371). Euler's totient φ(91371) = 49248 numbers up to 91371 share no factor with it.
- 4
The digits of 91371 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91371 = 3 \times 7 \times 19 \times 229 \]
91371 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 147200 |
| Euler totient φ(n) | 49248 |
| Square | 8348659641 |
| Cube | 762825380057811 |
| Square root | 302.276364 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 89 |
| Scientific notation | 9.1371 × |
91371 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand three hundred and seventy-one |
| Binary (base 2) | 10110010011101011 |
| Octal (base 8) | 262353 |
| Hexadecimal (base 16) | 164EB |
| Base 3 | 11122100010 |
| As time | 91371 seconds = 25 h 22 min 51 s |
Is 91371 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 (91371 ÷ 3 = 30457) | 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 | Yes (91371 ÷ 7 = 13053) | 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 3) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91371 a prime number?
No. 91371 = 3 × 7 × 19 × 229, so it is divisible by 3.
What are the factors of 91371?
1, 3, 7, 19, 21, 57, 133, 229, 399, 687, 1603, 4351, 4809, 13053, 30457, 91371.
What is 91371 in binary?
10110010011101011 (hexadecimal 164EB, octal 262353).
What is the square root of 91371?
About 302.2764.
Is 91371 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 91371?
91371 is a Harshad number: divisible by its digit sum 21.