The number 94091
94091 is a composite number with 4 divisors. Its prime factorisation is 37 × 2543. Divisors (4): 1, 37, 2543, 94091.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 94091: a semiprime: 37 × 2543, the product of two primes.
- 2
94091 is composite. Its prime factorisation is
- 3
The divisors add up to 96672; without 94091 itself that is 2581, so 94091 is deficient (2581 is less than 94091). Euler's totient φ(94091) = 91512 numbers up to 94091 share no factor with it.
- 4
The digits of 94091 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
\[ 94091 = 37 \times 2543 \]
94091 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 96672 |
| Euler totient φ(n) | 91512 |
| Square | 8853116281 |
| Cube | 832998563995571 |
| Square root | 306.742563 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.4091 × |
94091 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand and ninety-one |
| Binary (base 2) | 10110111110001011 |
| Octal (base 8) | 267613 |
| Hexadecimal (base 16) | 16F8B |
| Base 3 | 11210001212 |
| As time | 94091 seconds = 26 h 8 min 11 s |
Is 94091 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 3) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 5) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 94091 a prime number?
No. 94091 = 37 × 2543, so it is divisible by 37.
What are the factors of 94091?
1, 37, 2543, 94091.
What is 94091 in binary?
10110111110001011 (hexadecimal 16F8B, octal 267613).
What is the square root of 94091?
About 306.7426.
Is 94091 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 94091?
94091 is a semiprime: 37 × 2543, the product of two primes.