The number 49020
49020 is a composite number with 48 divisors. Its prime factorisation is × 3 × 5 × 19 × 43. Divisors (48): 1, 2, 3, 4, 5, 6, 10, 12, 15, 19, 20, 30, 38, 43, 57, 60 … 49020.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49020: a Harshad number: divisible by its digit sum 15.
- 2
49020 is composite. Its prime factorisation is
- 3
The divisors add up to 147840; without 49020 itself that is 98820, so 49020 is abundant (98820 is more than 49020). Euler's totient φ(49020) = 12096 numbers up to 49020 share no factor with it.
- 4
The digits of 49020 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49020 = 2^{2} \times 3 \times 5 \times 19 \times 43 \]49020 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 147840 |
| Euler totient φ(n) | 12096 |
| Square | 2402960400 |
| Cube | 117793118808000 |
| Square root | 221.404607 (= 2√12255) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.902 × |
49020 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and twenty |
| Binary (base 2) | 1011111101111100 |
| Octal (base 8) | 137574 |
| Hexadecimal (base 16) | BF7C |
| Base 3 | 2111020120 |
| As time | 49020 seconds = 13 h 37 min 0 s |
Is 49020 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49020 ÷ 2 = 24510) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49020 ÷ 3 = 16340) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (49020 ÷ 4 = 12255) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (49020 ÷ 5 = 9804) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (49020 ÷ 6 = 8170) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (49020 ÷ 10 = 4902) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (49020 ÷ 12 = 4085) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49020 a prime number?
No. 49020 = × 3 × 5 × 19 × 43, so it is divisible by 2.
What are the factors of 49020?
1, 2, 3, 4, 5, 6, 10, 12, 15, 19, 20, 30, 38, 43, 57, 60, 76, 86, 95, 114, 129, 172, 190, 215, 228, 258, 285, 380, 430, 516, 570, 645, 817, 860, 1140, 1290, 1634, 2451, 2580, 3268, 4085, 4902, 8170, 9804, 12255, 16340, 24510, 49020.
What is 49020 in binary?
1011111101111100 (hexadecimal BF7C, octal 137574).
What is the square root of 49020?
About 221.4046, exactly 2√12255.
Is 49020 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 49020?
49020 is a Harshad number: divisible by its digit sum 15.