The number 49280
49280 is a composite number with 64 divisors. Its prime factorisation is × 5 × 7 × 11. Divisors (64): 1, 2, 4, 5, 7, 8, 10, 11, 14, 16, 20, 22, 28, 32, 35, 40 … 49280.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49280 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49280 is composite. Its prime factorisation is
- 3
The divisors add up to 146880; without 49280 itself that is 97600, so 49280 is abundant (97600 is more than 49280). Euler's totient φ(49280) = 15360 numbers up to 49280 share no factor with it.
- 4
The digits of 49280 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49280 = 2^{7} \times 5 \times 7 \times 11 \]49280 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 64 |
| Sum of divisors | 146880 |
| Euler totient φ(n) | 15360 |
| Square | 2428518400 |
| Cube | 119677386752000 |
| Square root | 221.990991 (= 8√770) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 39 |
| Scientific notation | 4.928 × |
49280 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand two hundred and eighty |
| Binary (base 2) | 1100000010000000 |
| Octal (base 8) | 140200 |
| Hexadecimal (base 16) | C080 |
| Base 3 | 2111121012 |
| As time | 49280 seconds = 13 h 41 min 20 s |
Is 49280 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49280 ÷ 2 = 24640) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (49280 ÷ 4 = 12320) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (49280 ÷ 5 = 9856) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (49280 ÷ 7 = 7040) | 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 (49280 ÷ 8 = 6160) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (49280 ÷ 10 = 4928) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (49280 ÷ 11 = 4480) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49280 a prime number?
No. 49280 = × 5 × 7 × 11, so it is divisible by 2.
What are the factors of 49280?
1, 2, 4, 5, 7, 8, 10, 11, 14, 16, 20, 22, 28, 32, 35, 40, 44, 55, 56, 64, 70, 77, 80, 88, 110, 112, 128, 140, 154, 160, 176, 220, 224, 280, 308, 320, 352, 385, 440, 448, 560, 616, 640, 704, 770, 880, 896, 1120, 1232, 1408, 1540, 1760, 2240, 2464, 3080, 3520, 4480, 4928, 6160, 7040, 9856, 12320, 24640, 49280.
What is 49280 in binary?
1100000010000000 (hexadecimal C080, octal 140200).
What is the square root of 49280?
About 221.9910, exactly 8√770.
Is 49280 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 49280?
It is a composite number with 64 divisors.