The number 49947
49947 is a composite number with 4 divisors. Its prime factorisation is 3 × 16649. Divisors (4): 1, 3, 16649, 49947.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49947: a semiprime: 3 × 16649, the product of two primes.
- 2
49947 is composite. Its prime factorisation is
- 3
The divisors add up to 66600; without 49947 itself that is 16653, so 49947 is deficient (16653 is less than 49947). Euler's totient φ(49947) = 33296 numbers up to 49947 share no factor with it.
- 4
The digits of 49947 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49947 = 3 \times 16649 \]
49947 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 66600 |
| Euler totient φ(n) | 33296 |
| Square | 2494702809 |
| Cube | 124602921201123 |
| Square root | 223.488255 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 114 |
| Scientific notation | 4.9947 × |
49947 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand nine hundred and forty-seven |
| Binary (base 2) | 1100001100011011 |
| Octal (base 8) | 141433 |
| Hexadecimal (base 16) | C31B |
| Base 3 | 2112111220 |
| As time | 49947 seconds = 13 h 52 min 27 s |
Is 49947 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 (49947 ÷ 3 = 16649) | 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 2) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 49947 a prime number?
No. 49947 = 3 × 16649, so it is divisible by 3.
What are the factors of 49947?
1, 3, 16649, 49947.
What is 49947 in binary?
1100001100011011 (hexadecimal C31B, octal 141433).
What is the square root of 49947?
About 223.4883.
Is 49947 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 49947?
49947 is a semiprime: 3 × 16649, the product of two primes.