The number 49480
49480 is a composite number with 16 divisors. Its prime factorisation is × 5 × 1237. Divisors (16): 1, 2, 4, 5, 8, 10, 20, 40, 1237, 2474, 4948, 6185, 9896, 12370, 24740, 49480.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49480 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49480 is composite. Its prime factorisation is
- 3
The divisors add up to 111420; without 49480 itself that is 61940, so 49480 is abundant (61940 is more than 49480). Euler's totient φ(49480) = 19776 numbers up to 49480 share no factor with it.
- 4
The digits of 49480 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49480 = 2^{3} \times 5 \times 1237 \]49480 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 111420 |
| Euler totient φ(n) | 19776 |
| Square | 2448270400 |
| Cube | 121140419392000 |
| Square root | 222.441003 (= 2√12370) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.948 × |
49480 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand four hundred and eighty |
| Binary (base 2) | 1100000101001000 |
| Octal (base 8) | 140510 |
| Hexadecimal (base 16) | C148 |
| Base 3 | 2111212121 |
| As time | 49480 seconds = 13 h 44 min 40 s |
Is 49480 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49480 ÷ 2 = 24740) | 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 (49480 ÷ 4 = 12370) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (49480 ÷ 5 = 9896) | 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 4) | 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 (49480 ÷ 8 = 6185) | 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 (49480 ÷ 10 = 4948) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 49480 a prime number?
No. 49480 = × 5 × 1237, so it is divisible by 2.
What are the factors of 49480?
1, 2, 4, 5, 8, 10, 20, 40, 1237, 2474, 4948, 6185, 9896, 12370, 24740, 49480.
What is 49480 in binary?
1100000101001000 (hexadecimal C148, octal 140510).
What is the square root of 49480?
About 222.4410, exactly 2√12370.
Is 49480 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49480?
It is a composite number with 16 divisors.