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