The number 91041
91041 is a composite number with 4 divisors. Its prime factorisation is 3 × 30347. Divisors (4): 1, 3, 30347, 91041.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91041: a semiprime: 3 × 30347, the product of two primes.
- 2
91041 is composite. Its prime factorisation is
- 3
The divisors add up to 121392; without 91041 itself that is 30351, so 91041 is deficient (30351 is less than 91041). Euler's totient φ(91041) = 60692 numbers up to 91041 share no factor with it.
- 4
The digits of 91041 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91041 = 3 \times 30347 \]
91041 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 121392 |
| Euler totient φ(n) | 60692 |
| Square | 8288463681 |
| Cube | 754590021981921 |
| Square root | 301.730012 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.1041 × |
91041 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand and forty-one |
| Binary (base 2) | 10110001110100001 |
| Octal (base 8) | 261641 |
| Hexadecimal (base 16) | 163A1 |
| Base 3 | 11121212220 |
| As time | 91041 seconds = 25 h 17 min 21 s |
Is 91041 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 (91041 ÷ 3 = 30347) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 6) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91041 a prime number?
No. 91041 = 3 × 30347, so it is divisible by 3.
What are the factors of 91041?
1, 3, 30347, 91041.
What is 91041 in binary?
10110001110100001 (hexadecimal 163A1, octal 261641).
What is the square root of 91041?
About 301.7300.
Is 91041 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 91041?
91041 is a semiprime: 3 × 30347, the product of two primes.