The number 49941
49941 is a composite number with 12 divisors. Its prime factorisation is × 31 × 179. Divisors (12): 1, 3, 9, 31, 93, 179, 279, 537, 1611, 5549, 16647, 49941.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49941 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49941 is composite. Its prime factorisation is
- 3
The divisors add up to 74880; without 49941 itself that is 24939, so 49941 is deficient (24939 is less than 49941). Euler's totient φ(49941) = 32040 numbers up to 49941 share no factor with it.
- 4
The digits of 49941 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49941 = 3^{2} \times 31 \times 179 \]49941 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 74880 |
| Euler totient φ(n) | 32040 |
| Square | 2494103481 |
| Cube | 124558021944621 |
| Square root | 223.474831 (= 3√5549) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.9941 × |
49941 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand nine hundred and forty-one |
| Binary (base 2) | 1100001100010101 |
| Octal (base 8) | 141425 |
| Hexadecimal (base 16) | C315 |
| Base 3 | 2112111200 |
| As time | 49941 seconds = 13 h 52 min 21 s |
Is 49941 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 (49941 ÷ 3 = 16647) | 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 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 | Yes (49941 ÷ 9 = 5549) | 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 1) | 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 49941 a prime number?
No. 49941 = × 31 × 179, so it is divisible by 3.
What are the factors of 49941?
1, 3, 9, 31, 93, 179, 279, 537, 1611, 5549, 16647, 49941.
What is 49941 in binary?
1100001100010101 (hexadecimal C315, octal 141425).
What is the square root of 49941?
About 223.4748, exactly 3√5549.
Is 49941 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 49941?
It is a composite number with 12 divisors.