The number 49990
49990 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 4999. Divisors (8): 1, 2, 5, 10, 4999, 9998, 24995, 49990.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49990 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49990 is composite. Its prime factorisation is
- 3
The divisors add up to 90000; without 49990 itself that is 40010, so 49990 is deficient (40010 is less than 49990). Euler's totient φ(49990) = 19992 numbers up to 49990 share no factor with it.
- 4
The digits of 49990 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49990 = 2 \times 5 \times 4999 \]
49990 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 90000 |
| Euler totient φ(n) | 19992 |
| Square | 2499000100 |
| Cube | 124925014999000 |
| Square root | 223.584436 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.999 × |
49990 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand nine hundred and ninety |
| Binary (base 2) | 1100001101000110 |
| Octal (base 8) | 141506 |
| Hexadecimal (base 16) | C346 |
| Base 3 | 2112120111 |
| As time | 49990 seconds = 13 h 53 min 10 s |
Is 49990 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49990 ÷ 2 = 24995) | 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 (49990 ÷ 5 = 9998) | 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 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 6) | 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 (49990 ÷ 10 = 4999) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 49990 a prime number?
No. 49990 = 2 × 5 × 4999, so it is divisible by 2.
What are the factors of 49990?
1, 2, 5, 10, 4999, 9998, 24995, 49990.
What is 49990 in binary?
1100001101000110 (hexadecimal C346, octal 141506).
What is the square root of 49990?
About 223.5844.
Is 49990 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 49990?
It is a composite number with 8 divisors.