The number 49390
49390 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 11 × 449. Divisors (16): 1, 2, 5, 10, 11, 22, 55, 110, 449, 898, 2245, 4490, 4939, 9878, 24695, 49390.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49390 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49390 is composite. Its prime factorisation is
- 3
The divisors add up to 97200; without 49390 itself that is 47810, so 49390 is deficient (47810 is less than 49390). Euler's totient φ(49390) = 17920 numbers up to 49390 share no factor with it.
- 4
The digits of 49390 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49390 = 2 \times 5 \times 11 \times 449 \]
49390 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 97200 |
| Euler totient φ(n) | 17920 |
| Square | 2439372100 |
| Cube | 120480588019000 |
| Square root | 222.238611 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.939 × |
49390 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand three hundred and ninety |
| Binary (base 2) | 1100000011101110 |
| Octal (base 8) | 140356 |
| Hexadecimal (base 16) | C0EE |
| Base 3 | 2111202021 |
| As time | 49390 seconds = 13 h 43 min 10 s |
Is 49390 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49390 ÷ 2 = 24695) | 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 (49390 ÷ 5 = 9878) | 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 5) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (49390 ÷ 10 = 4939) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (49390 ÷ 11 = 4490) | 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 49390 a prime number?
No. 49390 = 2 × 5 × 11 × 449, so it is divisible by 2.
What are the factors of 49390?
1, 2, 5, 10, 11, 22, 55, 110, 449, 898, 2245, 4490, 4939, 9878, 24695, 49390.
What is 49390 in binary?
1100000011101110 (hexadecimal C0EE, octal 140356).
What is the square root of 49390?
About 222.2386.
Is 49390 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49390?
It is a composite number with 16 divisors.