The number 49580
49580 is a composite number with 24 divisors. Its prime factorisation is × 5 × 37 × 67. Divisors (24): 1, 2, 4, 5, 10, 20, 37, 67, 74, 134, 148, 185, 268, 335, 370, 670 … 49580.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49580 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49580 is composite. Its prime factorisation is
- 3
The divisors add up to 108528; without 49580 itself that is 58948, so 49580 is abundant (58948 is more than 49580). Euler's totient φ(49580) = 19008 numbers up to 49580 share no factor with it.
- 4
The digits of 49580 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49580 = 2^{2} \times 5 \times 37 \times 67 \]49580 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 108528 |
| Euler totient φ(n) | 19008 |
| Square | 2458176400 |
| Cube | 121876385912000 |
| Square root | 222.665669 (= 2√12395) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.958 × |
49580 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and eighty |
| Binary (base 2) | 1100000110101100 |
| Octal (base 8) | 140654 |
| Hexadecimal (base 16) | C1AC |
| Base 3 | 2112000022 |
| As time | 49580 seconds = 13 h 46 min 20 s |
Is 49580 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49580 ÷ 2 = 24790) | 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 (49580 ÷ 4 = 12395) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (49580 ÷ 5 = 9916) | 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 6) | 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (49580 ÷ 10 = 4958) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 49580 a prime number?
No. 49580 = × 5 × 37 × 67, so it is divisible by 2.
What are the factors of 49580?
1, 2, 4, 5, 10, 20, 37, 67, 74, 134, 148, 185, 268, 335, 370, 670, 740, 1340, 2479, 4958, 9916, 12395, 24790, 49580.
What is 49580 in binary?
1100000110101100 (hexadecimal C1AC, octal 140654).
What is the square root of 49580?
About 222.6657, exactly 2√12395.
Is 49580 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 49580?
It is a composite number with 24 divisors.