The number 49560
49560 is a composite number with 64 divisors. Its prime factorisation is × 3 × 5 × 7 × 59. Divisors (64): 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 15, 20, 21, 24, 28 … 49560.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49560: a Harshad number: divisible by its digit sum 24.
- 2
49560 is composite. Its prime factorisation is
- 3
The divisors add up to 172800; without 49560 itself that is 123240, so 49560 is abundant (123240 is more than 49560). Euler's totient φ(49560) = 11136 numbers up to 49560 share no factor with it.
- 4
The digits of 49560 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49560 = 2^{3} \times 3 \times 5 \times 7 \times 59 \]49560 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 64 |
| Sum of divisors | 172800 |
| Euler totient φ(n) | 11136 |
| Square | 2456193600 |
| Cube | 121728954816000 |
| Square root | 222.620754 (= 2√12390) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.956 × |
49560 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and sixty |
| Binary (base 2) | 1100000110011000 |
| Octal (base 8) | 140630 |
| Hexadecimal (base 16) | C198 |
| Base 3 | 2111222120 |
| As time | 49560 seconds = 13 h 46 min 0 s |
Is 49560 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49560 ÷ 2 = 24780) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49560 ÷ 3 = 16520) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (49560 ÷ 4 = 12390) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (49560 ÷ 5 = 9912) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (49560 ÷ 6 = 8260) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (49560 ÷ 7 = 7080) | 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 (49560 ÷ 8 = 6195) | 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 (49560 ÷ 10 = 4956) | 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 | Yes (49560 ÷ 12 = 4130) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49560 a prime number?
No. 49560 = × 3 × 5 × 7 × 59, so it is divisible by 2.
What are the factors of 49560?
1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 15, 20, 21, 24, 28, 30, 35, 40, 42, 56, 59, 60, 70, 84, 105, 118, 120, 140, 168, 177, 210, 236, 280, 295, 354, 413, 420, 472, 590, 708, 826, 840, 885, 1180, 1239, 1416, 1652, 1770, 2065, 2360, 2478, 3304, 3540, 4130, 4956, 6195, 7080, 8260, 9912, 12390, 16520, 24780, 49560.
What is 49560 in binary?
1100000110011000 (hexadecimal C198, octal 140630).
What is the square root of 49560?
About 222.6208, exactly 2√12390.
Is 49560 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 49560?
49560 is a Harshad number: divisible by its digit sum 24.