The number 49705
49705 is a composite number with 4 divisors. Its prime factorisation is 5 × 9941. Divisors (4): 1, 5, 9941, 49705.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49705: a semiprime: 5 × 9941, the product of two primes.
- 2
49705 is composite. Its prime factorisation is
- 3
The divisors add up to 59652; without 49705 itself that is 9947, so 49705 is deficient (9947 is less than 49705). Euler's totient φ(49705) = 39760 numbers up to 49705 share no factor with it.
- 4
The digits of 49705 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 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49705 = 5 \times 9941 \]
49705 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 59652 |
| Euler totient φ(n) | 39760 |
| Square | 2470587025 |
| Cube | 122800528077625 |
| Square root | 222.946182 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.9705 × |
49705 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand seven hundred and five |
| Binary (base 2) | 1100001000101001 |
| Octal (base 8) | 141051 |
| Hexadecimal (base 16) | C229 |
| Base 3 | 2112011221 |
| As time | 49705 seconds = 13 h 48 min 25 s |
Is 49705 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 | Yes (49705 ÷ 5 = 9941) | 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 5) | 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 5) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49705 a prime number?
No. 49705 = 5 × 9941, so it is divisible by 5.
What are the factors of 49705?
1, 5, 9941, 49705.
What is 49705 in binary?
1100001000101001 (hexadecimal C229, octal 141051).
What is the square root of 49705?
About 222.9462.
Is 49705 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49705?
49705 is a semiprime: 5 × 9941, the product of two primes.