The number 91312
91312 is a composite number with 20 divisors. Its prime factorisation is × 13 × 439. Divisors (20): 1, 2, 4, 8, 13, 16, 26, 52, 104, 208, 439, 878, 1756, 3512, 5707, 7024 … 91312.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91312: a Harshad number: divisible by its digit sum 16.
- 2
91312 is composite. Its prime factorisation is
- 3
The divisors add up to 190960; without 91312 itself that is 99648, so 91312 is abundant (99648 is more than 91312). Euler's totient φ(91312) = 42048 numbers up to 91312 share no factor with it.
- 4
The digits of 91312 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 32 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91312 = 2^{4} \times 13 \times 439 \]91312 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 190960 |
| Euler totient φ(n) | 42048 |
| Square | 8337881344 |
| Cube | 761348621283328 |
| Square root | 302.178755 (= 4√5707) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 32 |
| Scientific notation | 9.1312 × |
91312 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand three hundred and twelve |
| Binary (base 2) | 10110010010110000 |
| Octal (base 8) | 262260 |
| Hexadecimal (base 16) | 164B0 |
| Base 3 | 11122020221 |
| As time | 91312 seconds = 25 h 21 min 52 s |
Is 91312 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (91312 ÷ 2 = 45656) | 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 | Yes (91312 ÷ 4 = 22828) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 | Yes (91312 ÷ 8 = 11414) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91312 a prime number?
No. 91312 = × 13 × 439, so it is divisible by 2.
What are the factors of 91312?
1, 2, 4, 8, 13, 16, 26, 52, 104, 208, 439, 878, 1756, 3512, 5707, 7024, 11414, 22828, 45656, 91312.
What is 91312 in binary?
10110010010110000 (hexadecimal 164B0, octal 262260).
What is the square root of 91312?
About 302.1788, exactly 4√5707.
Is 91312 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 91312?
91312 is a Harshad number: divisible by its digit sum 16.