The number 91267
91267 is a composite number with 4 divisors. Its prime factorisation is 11 × 8297. Divisors (4): 1, 11, 8297, 91267.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91267: a semiprime: 11 × 8297, the product of two primes.
- 2
91267 is composite. Its prime factorisation is
- 3
The divisors add up to 99576; without 91267 itself that is 8309, so 91267 is deficient (8309 is less than 91267). Euler's totient φ(91267) = 82960 numbers up to 91267 share no factor with it.
- 4
The digits of 91267 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91267 = 11 \times 8297 \]
91267 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 99576 |
| Euler totient φ(n) | 82960 |
| Square | 8329665289 |
| Cube | 760223561931163 |
| Square root | 302.104287 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 71 |
| Scientific notation | 9.1267 × |
91267 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand two hundred and sixty-seven |
| Binary (base 2) | 10110010010000011 |
| Octal (base 8) | 262203 |
| Hexadecimal (base 16) | 16483 |
| Base 3 | 11122012021 |
| As time | 91267 seconds = 25 h 21 min 7 s |
Is 91267 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 | No (remainder 1) | 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 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (91267 ÷ 11 = 8297) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91267 a prime number?
No. 91267 = 11 × 8297, so it is divisible by 11.
What are the factors of 91267?
1, 11, 8297, 91267.
What is 91267 in binary?
10110010010000011 (hexadecimal 16483, octal 262203).
What is the square root of 91267?
About 302.1043.
Is 91267 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 91267?
91267 is a semiprime: 11 × 8297, the product of two primes.