The number 49971
49971 is a composite number with 4 divisors. Its prime factorisation is 3 × 16657. Divisors (4): 1, 3, 16657, 49971.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49971: a semiprime: 3 × 16657, the product of two primes.
- 2
49971 is composite. Its prime factorisation is
- 3
The divisors add up to 66632; without 49971 itself that is 16661, so 49971 is deficient (16661 is less than 49971). Euler's totient φ(49971) = 33312 numbers up to 49971 share no factor with it.
- 4
The digits of 49971 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49971 = 3 \times 16657 \]
49971 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 66632 |
| Euler totient φ(n) | 33312 |
| Square | 2497100841 |
| Cube | 124782626125611 |
| Square root | 223.541942 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.9971 × |
49971 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand nine hundred and seventy-one |
| Binary (base 2) | 1100001100110011 |
| Octal (base 8) | 141463 |
| Hexadecimal (base 16) | C333 |
| Base 3 | 2112112210 |
| As time | 49971 seconds = 13 h 52 min 51 s |
Is 49971 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 (49971 ÷ 3 = 16657) | 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 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 5) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 49971 a prime number?
No. 49971 = 3 × 16657, so it is divisible by 3.
What are the factors of 49971?
1, 3, 16657, 49971.
What is 49971 in binary?
1100001100110011 (hexadecimal C333, octal 141463).
What is the square root of 49971?
About 223.5419.
Is 49971 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 49971?
49971 is a semiprime: 3 × 16657, the product of two primes.