The number 49683
49683 is a composite number with 4 divisors. Its prime factorisation is 3 × 16561. Divisors (4): 1, 3, 16561, 49683.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49683: a semiprime: 3 × 16561, the product of two primes.
- 2
49683 is composite. Its prime factorisation is
- 3
The divisors add up to 66248; without 49683 itself that is 16565, so 49683 is deficient (16565 is less than 49683). Euler's totient φ(49683) = 33120 numbers up to 49683 share no factor with it.
- 4
The digits of 49683 add up to 30, 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
\[ 49683 = 3 \times 16561 \]
49683 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 66248 |
| Euler totient φ(n) | 33120 |
| Square | 2468400489 |
| Cube | 122637541494987 |
| Square root | 222.896837 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9683 × |
49683 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and eighty-three |
| Binary (base 2) | 1100001000010011 |
| Octal (base 8) | 141023 |
| Hexadecimal (base 16) | C213 |
| Base 3 | 2112011010 |
| As time | 49683 seconds = 13 h 48 min 3 s |
Is 49683 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 (49683 ÷ 3 = 16561) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 3) | 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 3) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49683 a prime number?
No. 49683 = 3 × 16561, so it is divisible by 3.
What are the factors of 49683?
1, 3, 16561, 49683.
What is 49683 in binary?
1100001000010011 (hexadecimal C213, octal 141023).
What is the square root of 49683?
About 222.8968.
Is 49683 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 49683?
49683 is a semiprime: 3 × 16561, the product of two primes.