The number 49641
49641 is a composite number with 4 divisors. Its prime factorisation is 3 × 16547. Divisors (4): 1, 3, 16547, 49641.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49641: a semiprime: 3 × 16547, the product of two primes.
- 2
49641 is composite. Its prime factorisation is
- 3
The divisors add up to 66192; without 49641 itself that is 16551, so 49641 is deficient (16551 is less than 49641). Euler's totient φ(49641) = 33092 numbers up to 49641 share no factor with it.
- 4
The digits of 49641 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49641 = 3 \times 16547 \]
49641 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 66192 |
| Euler totient φ(n) | 33092 |
| Square | 2464228881 |
| Cube | 122326785881721 |
| Square root | 222.802603 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 114 |
| Scientific notation | 4.9641 × |
49641 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and forty-one |
| Binary (base 2) | 1100000111101001 |
| Octal (base 8) | 140751 |
| Hexadecimal (base 16) | C1E9 |
| Base 3 | 2112002120 |
| As time | 49641 seconds = 13 h 47 min 21 s |
Is 49641 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 | Yes (49641 ÷ 3 = 16547) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49641 a prime number?
No. 49641 = 3 × 16547, so it is divisible by 3.
What are the factors of 49641?
1, 3, 16547, 49641.
What is 49641 in binary?
1100000111101001 (hexadecimal C1E9, octal 140751).
What is the square root of 49641?
About 222.8026.
Is 49641 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 49641?
49641 is a semiprime: 3 × 16547, the product of two primes.