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