The number 49490
49490 is a composite number with 24 divisors. Its prime factorisation is 2 × 5 × × 101. Divisors (24): 1, 2, 5, 7, 10, 14, 35, 49, 70, 98, 101, 202, 245, 490, 505, 707 … 49490.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49490 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49490 is composite. Its prime factorisation is
- 3
The divisors add up to 104652; without 49490 itself that is 55162, so 49490 is abundant (55162 is more than 49490). Euler's totient φ(49490) = 16800 numbers up to 49490 share no factor with it.
- 4
The digits of 49490 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49490 = 2 \times 5 \times 7^{2} \times 101 \]49490 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 104652 |
| Euler totient φ(n) | 16800 |
| Square | 2449260100 |
| Cube | 121213882349000 |
| Square root | 222.463480 (= 7√1010) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.949 × |
49490 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand four hundred and ninety |
| Binary (base 2) | 1100000101010010 |
| Octal (base 8) | 140522 |
| Hexadecimal (base 16) | C152 |
| Base 3 | 2111212222 |
| As time | 49490 seconds = 13 h 44 min 50 s |
Is 49490 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49490 ÷ 2 = 24745) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 (49490 ÷ 5 = 9898) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (49490 ÷ 7 = 7070) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (49490 ÷ 10 = 4949) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49490 a prime number?
No. 49490 = 2 × 5 × × 101, so it is divisible by 2.
What are the factors of 49490?
1, 2, 5, 7, 10, 14, 35, 49, 70, 98, 101, 202, 245, 490, 505, 707, 1010, 1414, 3535, 4949, 7070, 9898, 24745, 49490.
What is 49490 in binary?
1100000101010010 (hexadecimal C152, octal 140522).
What is the square root of 49490?
About 222.4635, exactly 7√1010.
Is 49490 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 49490?
It is a composite number with 24 divisors.