The number 47941
47941 is a composite number with 4 divisors. Its prime factorisation is 191 × 251. Divisors (4): 1, 191, 251, 47941.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47941: a semiprime: 191 × 251, the product of two primes.
- 2
47941 is composite. Its prime factorisation is
- 3
The divisors add up to 48384; without 47941 itself that is 443, so 47941 is deficient (443 is less than 47941). Euler's totient φ(47941) = 47500 numbers up to 47941 share no factor with it.
- 4
The digits of 47941 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 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47941 = 191 \times 251 \]
47941 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 48384 |
| Euler totient φ(n) | 47500 |
| Square | 2298339481 |
| Cube | 110184693058621 |
| Square root | 218.954333 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.7941 × |
47941 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and forty-one |
| Binary (base 2) | 1011101101000101 |
| Octal (base 8) | 135505 |
| Hexadecimal (base 16) | BB45 |
| Base 3 | 2102202121 |
| As time | 47941 seconds = 13 h 19 min 1 s |
Is 47941 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 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 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 47941 a prime number?
No. 47941 = 191 × 251, so it is divisible by 191.
What are the factors of 47941?
1, 191, 251, 47941.
What is 47941 in binary?
1011101101000101 (hexadecimal BB45, octal 135505).
What is the square root of 47941?
About 218.9543.
Is 47941 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 47941?
47941 is a semiprime: 191 × 251, the product of two primes.