The number 91065
91065 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 13 × 467. Divisors (16): 1, 3, 5, 13, 15, 39, 65, 195, 467, 1401, 2335, 6071, 7005, 18213, 30355, 91065.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91065 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91065 is composite. Its prime factorisation is
- 3
The divisors add up to 157248; without 91065 itself that is 66183, so 91065 is deficient (66183 is less than 91065). Euler's totient φ(91065) = 44736 numbers up to 91065 share no factor with it.
- 4
The digits of 91065 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
\[ 91065 = 3 \times 5 \times 13 \times 467 \]
91065 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 157248 |
| Euler totient φ(n) | 44736 |
| Square | 8292834225 |
| Cube | 755186948699625 |
| Square root | 301.769780 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.1065 × |
91065 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand and sixty-five |
| Binary (base 2) | 10110001110111001 |
| Octal (base 8) | 261671 |
| Hexadecimal (base 16) | 163B9 |
| Base 3 | 11121220210 |
| As time | 91065 seconds = 25 h 17 min 45 s |
Is 91065 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 (91065 ÷ 3 = 30355) | 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 | Yes (91065 ÷ 5 = 18213) | 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 2) | 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 1) | 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 7) | 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 91065 a prime number?
No. 91065 = 3 × 5 × 13 × 467, so it is divisible by 3.
What are the factors of 91065?
1, 3, 5, 13, 15, 39, 65, 195, 467, 1401, 2335, 6071, 7005, 18213, 30355, 91065.
What is 91065 in binary?
10110001110111001 (hexadecimal 163B9, octal 261671).
What is the square root of 91065?
About 301.7698.
Is 91065 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 91065?
It is a composite number with 16 divisors.