The number 49090
49090 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 4909. Divisors (8): 1, 2, 5, 10, 4909, 9818, 24545, 49090.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49090 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49090 is composite. Its prime factorisation is
- 3
The divisors add up to 88380; without 49090 itself that is 39290, so 49090 is deficient (39290 is less than 49090). Euler's totient φ(49090) = 19632 numbers up to 49090 share no factor with it.
- 4
The digits of 49090 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49090 = 2 \times 5 \times 4909 \]
49090 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 88380 |
| Euler totient φ(n) | 19632 |
| Square | 2409828100 |
| Cube | 118298461429000 |
| Square root | 221.562632 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.909 × |
49090 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and ninety |
| Binary (base 2) | 1011111111000010 |
| Octal (base 8) | 137702 |
| Hexadecimal (base 16) | BFC2 |
| Base 3 | 2111100011 |
| As time | 49090 seconds = 13 h 38 min 10 s |
Is 49090 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49090 ÷ 2 = 24545) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 (49090 ÷ 5 = 9818) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (49090 ÷ 10 = 4909) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49090 a prime number?
No. 49090 = 2 × 5 × 4909, so it is divisible by 2.
What are the factors of 49090?
1, 2, 5, 10, 4909, 9818, 24545, 49090.
What is 49090 in binary?
1011111111000010 (hexadecimal BFC2, octal 137702).
What is the square root of 49090?
About 221.5626.
Is 49090 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 49090?
It is a composite number with 8 divisors.