The number 91308
91308 is a composite number with 24 divisors. Its prime factorisation is × 3 × 7 × 1087. Divisors (24): 1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84, 1087, 2174, 3261, 4348 … 91308.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91308: a Harshad number: divisible by its digit sum 21.
- 2
91308 is composite. Its prime factorisation is
- 3
The divisors add up to 243712; without 91308 itself that is 152404, so 91308 is abundant (152404 is more than 91308). Euler's totient φ(91308) = 26064 numbers up to 91308 share no factor with it.
- 4
The digits of 91308 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 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91308 = 2^{2} \times 3 \times 7 \times 1087 \]91308 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 243712 |
| Euler totient φ(n) | 26064 |
| Square | 8337150864 |
| Cube | 761248571090112 |
| Square root | 302.172136 (= 2√22827) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.1308 × |
91308 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand three hundred and eight |
| Binary (base 2) | 10110010010101100 |
| Octal (base 8) | 262254 |
| Hexadecimal (base 16) | 164AC |
| Base 3 | 11122020210 |
| As time | 91308 seconds = 25 h 21 min 48 s |
Is 91308 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (91308 ÷ 2 = 45654) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (91308 ÷ 3 = 30436) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (91308 ÷ 4 = 22827) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (91308 ÷ 6 = 15218) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (91308 ÷ 7 = 13044) | 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 4) | 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 8) | 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 | Yes (91308 ÷ 12 = 7609) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91308 a prime number?
No. 91308 = × 3 × 7 × 1087, so it is divisible by 2.
What are the factors of 91308?
1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84, 1087, 2174, 3261, 4348, 6522, 7609, 13044, 15218, 22827, 30436, 45654, 91308.
What is 91308 in binary?
10110010010101100 (hexadecimal 164AC, octal 262254).
What is the square root of 91308?
About 302.1721, exactly 2√22827.
Is 91308 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 91308?
91308 is a Harshad number: divisible by its digit sum 21.