The number 49561
49561 is a composite number with 4 divisors. Its prime factorisation is 29 × 1709. Divisors (4): 1, 29, 1709, 49561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49561: a semiprime: 29 × 1709, the product of two primes.
- 2
49561 is composite. Its prime factorisation is
- 3
The divisors add up to 51300; without 49561 itself that is 1739, so 49561 is deficient (1739 is less than 49561). Euler's totient φ(49561) = 47824 numbers up to 49561 share no factor with it.
- 4
The digits of 49561 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49561 = 29 \times 1709 \]
49561 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 51300 |
| Euler totient φ(n) | 47824 |
| Square | 2456292721 |
| Cube | 121736323545481 |
| Square root | 222.623000 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.9561 × |
49561 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and sixty-one |
| Binary (base 2) | 1100000110011001 |
| Octal (base 8) | 140631 |
| Hexadecimal (base 16) | C199 |
| Base 3 | 2111222121 |
| As time | 49561 seconds = 13 h 46 min 1 s |
Is 49561 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 7) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49561 a prime number?
No. 49561 = 29 × 1709, so it is divisible by 29.
What are the factors of 49561?
1, 29, 1709, 49561.
What is 49561 in binary?
1100000110011001 (hexadecimal C199, octal 140631).
What is the square root of 49561?
About 222.6230.
Is 49561 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49561?
49561 is a semiprime: 29 × 1709, the product of two primes.