The number 49041
49041 is a composite number with 6 divisors. Its prime factorisation is × 5449. Divisors (6): 1, 3, 9, 5449, 16347, 49041.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49041 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49041 is composite. Its prime factorisation is
- 3
The divisors add up to 70850; without 49041 itself that is 21809, so 49041 is deficient (21809 is less than 49041). Euler's totient φ(49041) = 32688 numbers up to 49041 share no factor with it.
- 4
The digits of 49041 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49041 = 3^{2} \times 5449 \]49041 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 70850 |
| Euler totient φ(n) | 32688 |
| Square | 2405019681 |
| Cube | 117944570175921 |
| Square root | 221.452026 (= 3√5449) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9041 × |
49041 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and forty-one |
| Binary (base 2) | 1011111110010001 |
| Octal (base 8) | 137621 |
| Hexadecimal (base 16) | BF91 |
| Base 3 | 2111021100 |
| As time | 49041 seconds = 13 h 37 min 21 s |
Is 49041 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 (49041 ÷ 3 = 16347) | 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 6) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (49041 ÷ 9 = 5449) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49041 a prime number?
No. 49041 = × 5449, so it is divisible by 3.
What are the factors of 49041?
1, 3, 9, 5449, 16347, 49041.
What is 49041 in binary?
1011111110010001 (hexadecimal BF91, octal 137621).
What is the square root of 49041?
About 221.4520, exactly 3√5449.
Is 49041 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 49041?
It is a composite number with 6 divisors.