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