The number 49702
49702 is a composite number with 4 divisors. Its prime factorisation is 2 × 24851. Divisors (4): 1, 2, 24851, 49702.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49702: a semiprime: 2 × 24851, the product of two primes.
- 2
49702 is composite. Its prime factorisation is
- 3
The divisors add up to 74556; without 49702 itself that is 24854, so 49702 is deficient (24854 is less than 49702). Euler's totient φ(49702) = 24850 numbers up to 49702 share no factor with it.
- 4
The digits of 49702 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49702 = 2 \times 24851 \]
49702 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 74556 |
| Euler totient φ(n) | 24850 |
| Square | 2470288804 |
| Cube | 122778294136408 |
| Square root | 222.939454 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9702 × |
49702 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand seven hundred and two |
| Binary (base 2) | 1100001000100110 |
| Octal (base 8) | 141046 |
| Hexadecimal (base 16) | C226 |
| Base 3 | 2112011211 |
| As time | 49702 seconds = 13 h 48 min 22 s |
Is 49702 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49702 ÷ 2 = 24851) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49702 a prime number?
No. 49702 = 2 × 24851, so it is divisible by 2.
What are the factors of 49702?
1, 2, 24851, 49702.
What is 49702 in binary?
1100001000100110 (hexadecimal C226, octal 141046).
What is the square root of 49702?
About 222.9395.
Is 49702 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 49702?
49702 is a semiprime: 2 × 24851, the product of two primes.