The number 49260
49260 is a composite number with 24 divisors. Its prime factorisation is × 3 × 5 × 821. Divisors (24): 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 821, 1642, 2463, 3284 … 49260.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49260 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49260 is composite. Its prime factorisation is
- 3
The divisors add up to 138096; without 49260 itself that is 88836, so 49260 is abundant (88836 is more than 49260). Euler's totient φ(49260) = 13120 numbers up to 49260 share no factor with it.
- 4
The digits of 49260 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49260 = 2^{2} \times 3 \times 5 \times 821 \]49260 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 138096 |
| Euler totient φ(n) | 13120 |
| Square | 2426547600 |
| Cube | 119531734776000 |
| Square root | 221.945939 (= 2√12315) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.926 × |
49260 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand two hundred and sixty |
| Binary (base 2) | 1100000001101100 |
| Octal (base 8) | 140154 |
| Hexadecimal (base 16) | C06C |
| Base 3 | 2111120110 |
| As time | 49260 seconds = 13 h 41 min 0 s |
Is 49260 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49260 ÷ 2 = 24630) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49260 ÷ 3 = 16420) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (49260 ÷ 4 = 12315) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (49260 ÷ 5 = 9852) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (49260 ÷ 6 = 8210) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (49260 ÷ 10 = 4926) | 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 | Yes (49260 ÷ 12 = 4105) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49260 a prime number?
No. 49260 = × 3 × 5 × 821, so it is divisible by 2.
What are the factors of 49260?
1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 821, 1642, 2463, 3284, 4105, 4926, 8210, 9852, 12315, 16420, 24630, 49260.
What is 49260 in binary?
1100000001101100 (hexadecimal C06C, octal 140154).
What is the square root of 49260?
About 221.9459, exactly 2√12315.
Is 49260 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 49260?
It is a composite number with 24 divisors.