The number 49371
49371 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 2351. Divisors (8): 1, 3, 7, 21, 2351, 7053, 16457, 49371.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49371 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49371 is composite. Its prime factorisation is
- 3
The divisors add up to 75264; without 49371 itself that is 25893, so 49371 is deficient (25893 is less than 49371). Euler's totient φ(49371) = 28200 numbers up to 49371 share no factor with it.
- 4
The digits of 49371 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49371 = 3 \times 7 \times 2351 \]
49371 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 75264 |
| Euler totient φ(n) | 28200 |
| Square | 2437495641 |
| Cube | 120341597291811 |
| Square root | 222.195860 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9371 × |
49371 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand three hundred and seventy-one |
| Binary (base 2) | 1100000011011011 |
| Octal (base 8) | 140333 |
| Hexadecimal (base 16) | C0DB |
| Base 3 | 2111201120 |
| As time | 49371 seconds = 13 h 42 min 51 s |
Is 49371 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 (49371 ÷ 3 = 16457) | 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 | Yes (49371 ÷ 7 = 7053) | 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 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49371 a prime number?
No. 49371 = 3 × 7 × 2351, so it is divisible by 3.
What are the factors of 49371?
1, 3, 7, 21, 2351, 7053, 16457, 49371.
What is 49371 in binary?
1100000011011011 (hexadecimal C0DB, octal 140333).
What is the square root of 49371?
About 222.1959.
Is 49371 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 49371?
It is a composite number with 8 divisors.