The number 49120
49120 is a composite number with 24 divisors. Its prime factorisation is × 5 × 307. Divisors (24): 1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 80, 160, 307, 614, 1228, 1535 … 49120.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49120: a Harshad number: divisible by its digit sum 16.
- 2
49120 is composite. Its prime factorisation is
- 3
The divisors add up to 116424; without 49120 itself that is 67304, so 49120 is abundant (67304 is more than 49120). Euler's totient φ(49120) = 19584 numbers up to 49120 share no factor with it.
- 4
The digits of 49120 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49120 = 2^{5} \times 5 \times 307 \]49120 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 116424 |
| Euler totient φ(n) | 19584 |
| Square | 2412774400 |
| Cube | 118515478528000 |
| Square root | 221.630323 (= 4√3070) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.912 × |
49120 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and twenty |
| Binary (base 2) | 1011111111100000 |
| Octal (base 8) | 137740 |
| Hexadecimal (base 16) | BFE0 |
| Base 3 | 2111101021 |
| As time | 49120 seconds = 13 h 38 min 40 s |
Is 49120 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49120 ÷ 2 = 24560) | 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 | Yes (49120 ÷ 4 = 12280) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (49120 ÷ 5 = 9824) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 | Yes (49120 ÷ 8 = 6140) | 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 | Yes (49120 ÷ 10 = 4912) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49120 a prime number?
No. 49120 = × 5 × 307, so it is divisible by 2.
What are the factors of 49120?
1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 80, 160, 307, 614, 1228, 1535, 2456, 3070, 4912, 6140, 9824, 12280, 24560, 49120.
What is 49120 in binary?
1011111111100000 (hexadecimal BFE0, octal 137740).
What is the square root of 49120?
About 221.6303, exactly 4√3070.
Is 49120 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 49120?
49120 is a Harshad number: divisible by its digit sum 16.