The number 49961
49961 is a composite number with 4 divisors. Its prime factorisation is 47 × 1063. Divisors (4): 1, 47, 1063, 49961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49961: a semiprime: 47 × 1063, the product of two primes.
- 2
49961 is composite. Its prime factorisation is
- 3
The divisors add up to 51072; without 49961 itself that is 1111, so 49961 is deficient (1111 is less than 49961). Euler's totient φ(49961) = 48852 numbers up to 49961 share no factor with it.
- 4
The digits of 49961 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 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49961 = 47 \times 1063 \]
49961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 51072 |
| Euler totient φ(n) | 48852 |
| Square | 2496101521 |
| Cube | 124707728090681 |
| Square root | 223.519574 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.9961 × |
49961 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand nine hundred and sixty-one |
| Binary (base 2) | 1100001100101001 |
| Octal (base 8) | 141451 |
| Hexadecimal (base 16) | C329 |
| Base 3 | 2112112102 |
| As time | 49961 seconds = 13 h 52 min 41 s |
Is 49961 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 2) | 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 2) | 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 10) | 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 49961 a prime number?
No. 49961 = 47 × 1063, so it is divisible by 47.
What are the factors of 49961?
1, 47, 1063, 49961.
What is 49961 in binary?
1100001100101001 (hexadecimal C329, octal 141451).
What is the square root of 49961?
About 223.5196.
Is 49961 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 49961?
49961 is a semiprime: 47 × 1063, the product of two primes.