The number 49640
49640 is a composite number with 32 divisors. Its prime factorisation is × 5 × 17 × 73. Divisors (32): 1, 2, 4, 5, 8, 10, 17, 20, 34, 40, 68, 73, 85, 136, 146, 170 … 49640.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49640 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49640 is composite. Its prime factorisation is
- 3
The divisors add up to 119880; without 49640 itself that is 70240, so 49640 is abundant (70240 is more than 49640). Euler's totient φ(49640) = 18432 numbers up to 49640 share no factor with it.
- 4
The digits of 49640 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49640 = 2^{3} \times 5 \times 17 \times 73 \]49640 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 119880 |
| Euler totient φ(n) | 18432 |
| Square | 2464129600 |
| Cube | 122319393344000 |
| Square root | 222.800359 (= 2√12410) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.964 × |
49640 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and forty |
| Binary (base 2) | 1100000111101000 |
| Octal (base 8) | 140750 |
| Hexadecimal (base 16) | C1E8 |
| Base 3 | 2112002112 |
| As time | 49640 seconds = 13 h 47 min 20 s |
Is 49640 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49640 ÷ 2 = 24820) | 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 | Yes (49640 ÷ 4 = 12410) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (49640 ÷ 5 = 9928) | 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 | 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 | Yes (49640 ÷ 8 = 6205) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (49640 ÷ 10 = 4964) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49640 a prime number?
No. 49640 = × 5 × 17 × 73, so it is divisible by 2.
What are the factors of 49640?
1, 2, 4, 5, 8, 10, 17, 20, 34, 40, 68, 73, 85, 136, 146, 170, 292, 340, 365, 584, 680, 730, 1241, 1460, 2482, 2920, 4964, 6205, 9928, 12410, 24820, 49640.
What is 49640 in binary?
1100000111101000 (hexadecimal C1E8, octal 140750).
What is the square root of 49640?
About 222.8004, exactly 2√12410.
Is 49640 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 49640?
It is a composite number with 32 divisors.