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