The number 91931
91931 is a composite number with 8 divisors. Its prime factorisation is 7 × 23 × 571. Divisors (8): 1, 7, 23, 161, 571, 3997, 13133, 91931.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91931: a Harshad number: divisible by its digit sum 23.
- 2
91931 is composite. Its prime factorisation is
- 3
The divisors add up to 109824; without 91931 itself that is 17893, so 91931 is deficient (17893 is less than 91931). Euler's totient φ(91931) = 75240 numbers up to 91931 share no factor with it.
- 4
The digits of 91931 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91931 = 7 \times 23 \times 571 \]
91931 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 109824 |
| Euler totient φ(n) | 75240 |
| Square | 8451308761 |
| Cube | 776937265707491 |
| Square root | 303.201253 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.1931 × |
91931 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand nine hundred and thirty-one |
| Binary (base 2) | 10110011100011011 |
| Octal (base 8) | 263433 |
| Hexadecimal (base 16) | 1671B |
| Base 3 | 11200002212 |
| As time | 91931 seconds = 25 h 32 min 11 s |
Is 91931 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 | Yes (91931 ÷ 7 = 13133) | 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 5) | 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 91931 a prime number?
No. 91931 = 7 × 23 × 571, so it is divisible by 7.
What are the factors of 91931?
1, 7, 23, 161, 571, 3997, 13133, 91931.
What is 91931 in binary?
10110011100011011 (hexadecimal 1671B, octal 263433).
What is the square root of 91931?
About 303.2013.
Is 91931 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 91931?
91931 is a Harshad number: divisible by its digit sum 23.