The number 49520
49520 is a composite number with 20 divisors. Its prime factorisation is × 5 × 619. Divisors (20): 1, 2, 4, 5, 8, 10, 16, 20, 40, 80, 619, 1238, 2476, 3095, 4952, 6190 … 49520.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49520: a Harshad number: divisible by its digit sum 20.
- 2
49520 is composite. Its prime factorisation is
- 3
The divisors add up to 115320; without 49520 itself that is 65800, so 49520 is abundant (65800 is more than 49520). Euler's totient φ(49520) = 19776 numbers up to 49520 share no factor with it.
- 4
The digits of 49520 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49520 = 2^{4} \times 5 \times 619 \]49520 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 115320 |
| Euler totient φ(n) | 19776 |
| Square | 2452230400 |
| Cube | 121434449408000 |
| Square root | 222.530897 (= 4√3095) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 39 |
| Scientific notation | 4.952 × |
49520 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and twenty |
| Binary (base 2) | 1100000101110000 |
| Octal (base 8) | 140560 |
| Hexadecimal (base 16) | C170 |
| Base 3 | 2111221002 |
| As time | 49520 seconds = 13 h 45 min 20 s |
Is 49520 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49520 ÷ 2 = 24760) | 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 (49520 ÷ 4 = 12380) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (49520 ÷ 5 = 9904) | 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 | No (remainder 2) | 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 (49520 ÷ 8 = 6190) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (49520 ÷ 10 = 4952) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 49520 a prime number?
No. 49520 = × 5 × 619, so it is divisible by 2.
What are the factors of 49520?
1, 2, 4, 5, 8, 10, 16, 20, 40, 80, 619, 1238, 2476, 3095, 4952, 6190, 9904, 12380, 24760, 49520.
What is 49520 in binary?
1100000101110000 (hexadecimal C170, octal 140560).
What is the square root of 49520?
About 222.5309, exactly 4√3095.
Is 49520 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 49520?
49520 is a Harshad number: divisible by its digit sum 20.