The number 91049
91049 is a composite number with 4 divisors. Its prime factorisation is 7 × 13007. Divisors (4): 1, 7, 13007, 91049.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91049: a semiprime: 7 × 13007, the product of two primes.
- 2
91049 is composite. Its prime factorisation is
- 3
The divisors add up to 104064; without 91049 itself that is 13015, so 91049 is deficient (13015 is less than 91049). Euler's totient φ(91049) = 78036 numbers up to 91049 share no factor with it.
- 4
The digits of 91049 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 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91049 = 7 \times 13007 \]
91049 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 104064 |
| Euler totient φ(n) | 78036 |
| Square | 8289920401 |
| Cube | 754788962590649 |
| Square root | 301.743268 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 89 |
| Scientific notation | 9.1049 × |
91049 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand and forty-nine |
| Binary (base 2) | 10110001110101001 |
| Octal (base 8) | 261651 |
| Hexadecimal (base 16) | 163A9 |
| Base 3 | 11121220012 |
| As time | 91049 seconds = 25 h 17 min 29 s |
Is 91049 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 2) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (91049 ÷ 7 = 13007) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91049 a prime number?
No. 91049 = 7 × 13007, so it is divisible by 7.
What are the factors of 91049?
1, 7, 13007, 91049.
What is 91049 in binary?
10110001110101001 (hexadecimal 163A9, octal 261651).
What is the square root of 91049?
About 301.7433.
Is 91049 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 91049?
91049 is a semiprime: 7 × 13007, the product of two primes.