The number 91395
91395 is a composite number with 16 divisors. Its prime factorisation is × 5 × 677. Divisors (16): 1, 3, 5, 9, 15, 27, 45, 135, 677, 2031, 3385, 6093, 10155, 18279, 30465, 91395.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91395: a Harshad number: divisible by its digit sum 27.
- 2
91395 is composite. Its prime factorisation is
- 3
The divisors add up to 162720; without 91395 itself that is 71325, so 91395 is deficient (71325 is less than 91395). Euler's totient φ(91395) = 48672 numbers up to 91395 share no factor with it.
- 4
The digits of 91395 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91395 = 3^{3} \times 5 \times 677 \]91395 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 162720 |
| Euler totient φ(n) | 48672 |
| Square | 8353046025 |
| Cube | 763426641454875 |
| Square root | 302.316060 (= 3√10155) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.1395 × |
91395 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand three hundred and ninety-five |
| Binary (base 2) | 10110010100000011 |
| Octal (base 8) | 262403 |
| Hexadecimal (base 16) | 16503 |
| Base 3 | 11122101000 |
| As time | 91395 seconds = 25 h 23 min 15 s |
Is 91395 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 (91395 ÷ 3 = 30465) | 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 (91395 ÷ 5 = 18279) | 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 3) | 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 | Yes (91395 ÷ 9 = 10155) | 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 7) | 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 91395 a prime number?
No. 91395 = × 5 × 677, so it is divisible by 3.
What are the factors of 91395?
1, 3, 5, 9, 15, 27, 45, 135, 677, 2031, 3385, 6093, 10155, 18279, 30465, 91395.
What is 91395 in binary?
10110010100000011 (hexadecimal 16503, octal 262403).
What is the square root of 91395?
About 302.3161, exactly 3√10155.
Is 91395 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 91395?
91395 is a Harshad number: divisible by its digit sum 27.