The number 49050
49050 is a composite number with 36 divisors. Its prime factorisation is 2 × × × 109. Divisors (36): 1, 2, 3, 5, 6, 9, 10, 15, 18, 25, 30, 45, 50, 75, 90, 109 … 49050.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49050: a Harshad number: divisible by its digit sum 18.
- 2
49050 is composite. Its prime factorisation is
- 3
The divisors add up to 132990; without 49050 itself that is 83940, so 49050 is abundant (83940 is more than 49050). Euler's totient φ(49050) = 12960 numbers up to 49050 share no factor with it.
- 4
The digits of 49050 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
\[ 49050 = 2 \times 3^{2} \times 5^{2} \times 109 \]49050 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 36 |
| Sum of divisors | 132990 |
| Euler totient φ(n) | 12960 |
| Square | 2405902500 |
| Cube | 118009517625000 |
| Square root | 221.472346 (= 15√218) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.905 × |
49050 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and fifty |
| Binary (base 2) | 1011111110011010 |
| Octal (base 8) | 137632 |
| Hexadecimal (base 16) | BF9A |
| Base 3 | 2111021200 |
| As time | 49050 seconds = 13 h 37 min 30 s |
Is 49050 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49050 ÷ 2 = 24525) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49050 ÷ 3 = 16350) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (49050 ÷ 5 = 9810) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (49050 ÷ 6 = 8175) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (49050 ÷ 9 = 5450) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (49050 ÷ 10 = 4905) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49050 a prime number?
No. 49050 = 2 × × × 109, so it is divisible by 2.
What are the factors of 49050?
1, 2, 3, 5, 6, 9, 10, 15, 18, 25, 30, 45, 50, 75, 90, 109, 150, 218, 225, 327, 450, 545, 654, 981, 1090, 1635, 1962, 2725, 3270, 4905, 5450, 8175, 9810, 16350, 24525, 49050.
What is 49050 in binary?
1011111110011010 (hexadecimal BF9A, octal 137632).
What is the square root of 49050?
About 221.4723, exactly 15√218.
Is 49050 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 49050?
49050 is a Harshad number: divisible by its digit sum 18.