The number 94741
94741 is a composite number with 4 divisors. Its prime factorisation is 17 × 5573. Divisors (4): 1, 17, 5573, 94741.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 94741: a semiprime: 17 × 5573, the product of two primes.
- 2
94741 is composite. Its prime factorisation is
- 3
The divisors add up to 100332; without 94741 itself that is 5591, so 94741 is deficient (5591 is less than 94741). Euler's totient φ(94741) = 89152 numbers up to 94741 share no factor with it.
- 4
The digits of 94741 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 190 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94741 = 17 \times 5573 \]
94741 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 100332 |
| Euler totient φ(n) | 89152 |
| Square | 8975857081 |
| Cube | 850381675711021 |
| Square root | 307.800260 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 190 |
| Scientific notation | 9.4741 × |
94741 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand seven hundred and forty-one |
| Binary (base 2) | 10111001000010101 |
| Octal (base 8) | 271025 |
| Hexadecimal (base 16) | 17215 |
| Base 3 | 11210221221 |
| As time | 94741 seconds = 26 h 19 min 1 s |
Is 94741 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 3) | 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 7) | 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 9) | 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 94741 a prime number?
No. 94741 = 17 × 5573, so it is divisible by 17.
What are the factors of 94741?
1, 17, 5573, 94741.
What is 94741 in binary?
10111001000010101 (hexadecimal 17215, octal 271025).
What is the square root of 94741?
About 307.8003.
Is 94741 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 94741?
94741 is a semiprime: 17 × 5573, the product of two primes.