The number 91364
91364 is a composite number with 24 divisors. Its prime factorisation is × 7 × 13 × 251. Divisors (24): 1, 2, 4, 7, 13, 14, 26, 28, 52, 91, 182, 251, 364, 502, 1004, 1757 … 91364.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91364 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91364 is composite. Its prime factorisation is
- 3
The divisors add up to 197568; without 91364 itself that is 106204, so 91364 is abundant (106204 is more than 91364). Euler's totient φ(91364) = 36000 numbers up to 91364 share no factor with it.
- 4
The digits of 91364 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91364 = 2^{2} \times 7 \times 13 \times 251 \]91364 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 197568 |
| Euler totient φ(n) | 36000 |
| Square | 8347380496 |
| Cube | 762650071636544 |
| Square root | 302.264785 (= 2√22841) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.1364 × |
91364 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand three hundred and sixty-four |
| Binary (base 2) | 10110010011100100 |
| Octal (base 8) | 262344 |
| Hexadecimal (base 16) | 164E4 |
| Base 3 | 11122022212 |
| As time | 91364 seconds = 25 h 22 min 44 s |
Is 91364 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (91364 ÷ 2 = 45682) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (91364 ÷ 4 = 22841) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (91364 ÷ 7 = 13052) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91364 a prime number?
No. 91364 = × 7 × 13 × 251, so it is divisible by 2.
What are the factors of 91364?
1, 2, 4, 7, 13, 14, 26, 28, 52, 91, 182, 251, 364, 502, 1004, 1757, 3263, 3514, 6526, 7028, 13052, 22841, 45682, 91364.
What is 91364 in binary?
10110010011100100 (hexadecimal 164E4, octal 262344).
What is the square root of 91364?
About 302.2648, exactly 2√22841.
Is 91364 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 91364?
It is a composite number with 24 divisors.