The number 91335
91335 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 6089. Divisors (8): 1, 3, 5, 15, 6089, 18267, 30445, 91335.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91335 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91335 is composite. Its prime factorisation is
- 3
The divisors add up to 146160; without 91335 itself that is 54825, so 91335 is deficient (54825 is less than 91335). Euler's totient φ(91335) = 48704 numbers up to 91335 share no factor with it.
- 4
The digits of 91335 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 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91335 = 3 \times 5 \times 6089 \]
91335 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 146160 |
| Euler totient φ(n) | 48704 |
| Square | 8342082225 |
| Cube | 761924080020375 |
| Square root | 302.216810 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 71 |
| Scientific notation | 9.1335 × |
91335 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand three hundred and thirty-five |
| Binary (base 2) | 10110010011000111 |
| Octal (base 8) | 262307 |
| Hexadecimal (base 16) | 164C7 |
| Base 3 | 11122021210 |
| As time | 91335 seconds = 25 h 22 min 15 s |
Is 91335 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 (91335 ÷ 3 = 30445) | 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 | Yes (91335 ÷ 5 = 18267) | 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 6) | 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 7) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 91335 a prime number?
No. 91335 = 3 × 5 × 6089, so it is divisible by 3.
What are the factors of 91335?
1, 3, 5, 15, 6089, 18267, 30445, 91335.
What is 91335 in binary?
10110010011000111 (hexadecimal 164C7, octal 262307).
What is the square root of 91335?
About 302.2168.
Is 91335 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 91335?
It is a composite number with 8 divisors.