The number 91341
91341 is a composite number with 16 divisors. Its prime factorisation is × 17 × 199. Divisors (16): 1, 3, 9, 17, 27, 51, 153, 199, 459, 597, 1791, 3383, 5373, 10149, 30447, 91341.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91341 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91341 is composite. Its prime factorisation is
- 3
The divisors add up to 144000; without 91341 itself that is 52659, so 91341 is deficient (52659 is less than 91341). Euler's totient φ(91341) = 57024 numbers up to 91341 share no factor with it.
- 4
The digits of 91341 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91341 = 3^{3} \times 17 \times 199 \]91341 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 144000 |
| Euler totient φ(n) | 57024 |
| Square | 8343178281 |
| Cube | 762074247364821 |
| Square root | 302.226736 (= 3√10149) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 133 |
| Scientific notation | 9.1341 × |
91341 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand three hundred and forty-one |
| Binary (base 2) | 10110010011001101 |
| Octal (base 8) | 262315 |
| Hexadecimal (base 16) | 164CD |
| Base 3 | 11122022000 |
| As time | 91341 seconds = 25 h 22 min 21 s |
Is 91341 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 (91341 ÷ 3 = 30447) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 5) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (91341 ÷ 9 = 10149) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91341 a prime number?
No. 91341 = × 17 × 199, so it is divisible by 3.
What are the factors of 91341?
1, 3, 9, 17, 27, 51, 153, 199, 459, 597, 1791, 3383, 5373, 10149, 30447, 91341.
What is 91341 in binary?
10110010011001101 (hexadecimal 164CD, octal 262315).
What is the square root of 91341?
About 302.2267, exactly 3√10149.
Is 91341 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 91341?
It is a composite number with 16 divisors.