The number 49661
49661 is a composite number with 4 divisors. Its prime factorisation is 53 × 937. Divisors (4): 1, 53, 937, 49661.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49661: a semiprime: 53 × 937, the product of two primes.
- 2
49661 is composite. Its prime factorisation is
- 3
The divisors add up to 50652; without 49661 itself that is 991, so 49661 is deficient (991 is less than 49661). Euler's totient φ(49661) = 48672 numbers up to 49661 share no factor with it.
- 4
The digits of 49661 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 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49661 = 53 \times 937 \]
49661 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50652 |
| Euler totient φ(n) | 48672 |
| Square | 2466214921 |
| Cube | 122474699191781 |
| Square root | 222.847481 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9661 × |
49661 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and sixty-one |
| Binary (base 2) | 1100000111111101 |
| Octal (base 8) | 140775 |
| Hexadecimal (base 16) | C1FD |
| Base 3 | 2112010022 |
| As time | 49661 seconds = 13 h 47 min 41 s |
Is 49661 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 1) | 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 | 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 | No (remainder 5) | 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 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 49661 a prime number?
No. 49661 = 53 × 937, so it is divisible by 53.
What are the factors of 49661?
1, 53, 937, 49661.
What is 49661 in binary?
1100000111111101 (hexadecimal C1FD, octal 140775).
What is the square root of 49661?
About 222.8475.
Is 49661 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 49661?
49661 is a semiprime: 53 × 937, the product of two primes.