The number 49890
49890 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 1663. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 1663, 3326, 4989, 8315, 9978, 16630, 24945, 49890.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49890: a Harshad number: divisible by its digit sum 30.
- 2
49890 is composite. Its prime factorisation is
- 3
The divisors add up to 119808; without 49890 itself that is 69918, so 49890 is abundant (69918 is more than 49890). Euler's totient φ(49890) = 13296 numbers up to 49890 share no factor with it.
- 4
The digits of 49890 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49890 = 2 \times 3 \times 5 \times 1663 \]
49890 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 119808 |
| Euler totient φ(n) | 13296 |
| Square | 2489012100 |
| Cube | 124176813669000 |
| Square root | 223.360695 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.989 × |
49890 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand eight hundred and ninety |
| Binary (base 2) | 1100001011100010 |
| Octal (base 8) | 141342 |
| Hexadecimal (base 16) | C2E2 |
| Base 3 | 2112102210 |
| As time | 49890 seconds = 13 h 51 min 30 s |
Is 49890 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49890 ÷ 2 = 24945) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49890 ÷ 3 = 16630) | 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 (49890 ÷ 5 = 9978) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (49890 ÷ 6 = 8315) | 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 2) | 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 (49890 ÷ 10 = 4989) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 49890 a prime number?
No. 49890 = 2 × 3 × 5 × 1663, so it is divisible by 2.
What are the factors of 49890?
1, 2, 3, 5, 6, 10, 15, 30, 1663, 3326, 4989, 8315, 9978, 16630, 24945, 49890.
What is 49890 in binary?
1100001011100010 (hexadecimal C2E2, octal 141342).
What is the square root of 49890?
About 223.3607.
Is 49890 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 49890?
49890 is a Harshad number: divisible by its digit sum 30.