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