The number 49637
49637 is a composite number with 6 divisors. Its prime factorisation is Ć 1013. Divisors (6): 1, 7, 49, 1013, 7091, 49637.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49637 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49637 is composite. Its prime factorisation is
- 3
The divisors add up to 57798; without 49637 itself that is 8161, so 49637 is deficient (8161 is less than 49637). Euler's totient Ļ(49637) = 42504 numbers up to 49637 share no factor with it.
- 4
The digits of 49637 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49637 = 7^{2} \times 1013 \]49637 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 57798 |
| Euler totient Ļ(n) | 42504 |
| Square | 2463831769 |
| Cube | 122297217517853 |
| Square root | 222.793626 (= 7ā1013) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9637 Ć |
49637 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and thirty-seven |
| Binary (base 2) | 1100000111100101 |
| Octal (base 8) | 140745 |
| Hexadecimal (base 16) | C1E5 |
| Base 3 | 2112002102 |
| As time | 49637 seconds = 13 h 47 min 17 s |
Is 49637 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (49637 Ć· 7 = 7091) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49637 a prime number?
No. 49637 = Ć 1013, so it is divisible by 7.
What are the factors of 49637?
1, 7, 49, 1013, 7091, 49637.
What is 49637 in binary?
1100000111100101 (hexadecimal C1E5, octal 140745).
What is the square root of 49637?
About 222.7936, exactly 7ā1013.
Is 49637 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 49637?
It is a composite number with 6 divisors.