The number 49290
49290 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 5 × 31 × 53. Divisors (32): 1, 2, 3, 5, 6, 10, 15, 30, 31, 53, 62, 93, 106, 155, 159, 186 … 49290.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49290 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49290 is composite. Its prime factorisation is
- 3
The divisors add up to 124416; without 49290 itself that is 75126, so 49290 is abundant (75126 is more than 49290). Euler's totient φ(49290) = 12480 numbers up to 49290 share no factor with it.
- 4
The digits of 49290 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 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49290 = 2 \times 3 \times 5 \times 31 \times 53 \]
49290 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 124416 |
| Euler totient φ(n) | 12480 |
| Square | 2429504100 |
| Cube | 119750257089000 |
| Square root | 222.013513 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 39 |
| Scientific notation | 4.929 × |
49290 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand two hundred and ninety |
| Binary (base 2) | 1100000010001010 |
| Octal (base 8) | 140212 |
| Hexadecimal (base 16) | C08A |
| Base 3 | 2111121120 |
| As time | 49290 seconds = 13 h 41 min 30 s |
Is 49290 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49290 ÷ 2 = 24645) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49290 ÷ 3 = 16430) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (49290 ÷ 5 = 9858) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (49290 ÷ 6 = 8215) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 2) | 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 (49290 ÷ 10 = 4929) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49290 a prime number?
No. 49290 = 2 × 3 × 5 × 31 × 53, so it is divisible by 2.
What are the factors of 49290?
1, 2, 3, 5, 6, 10, 15, 30, 31, 53, 62, 93, 106, 155, 159, 186, 265, 310, 318, 465, 530, 795, 930, 1590, 1643, 3286, 4929, 8215, 9858, 16430, 24645, 49290.
What is 49290 in binary?
1100000010001010 (hexadecimal C08A, octal 140212).
What is the square root of 49290?
About 222.0135.
Is 49290 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 49290?
It is a composite number with 32 divisors.