The number 49709
49709 is a composite number with 4 divisors. Its prime factorisation is 11 × 4519. Divisors (4): 1, 11, 4519, 49709.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49709: a semiprime: 11 × 4519, the product of two primes.
- 2
49709 is composite. Its prime factorisation is
- 3
The divisors add up to 54240; without 49709 itself that is 4531, so 49709 is deficient (4531 is less than 49709). Euler's totient φ(49709) = 45180 numbers up to 49709 share no factor with it.
- 4
The digits of 49709 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49709 = 11 \times 4519 \]
49709 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 54240 |
| Euler totient φ(n) | 45180 |
| Square | 2470984681 |
| Cube | 122830177507829 |
| Square root | 222.955152 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.9709 × |
49709 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand seven hundred and nine |
| Binary (base 2) | 1100001000101101 |
| Octal (base 8) | 141055 |
| Hexadecimal (base 16) | C22D |
| Base 3 | 2112012002 |
| As time | 49709 seconds = 13 h 48 min 29 s |
Is 49709 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 4) | 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 5) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (49709 ÷ 11 = 4519) | 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 49709 a prime number?
No. 49709 = 11 × 4519, so it is divisible by 11.
What are the factors of 49709?
1, 11, 4519, 49709.
What is 49709 in binary?
1100001000101101 (hexadecimal C22D, octal 141055).
What is the square root of 49709?
About 222.9552.
Is 49709 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 49709?
49709 is a semiprime: 11 × 4519, the product of two primes.