The number 49851
49851 is a composite number with 12 divisors. Its prime factorisation is × 29 × 191. Divisors (12): 1, 3, 9, 29, 87, 191, 261, 573, 1719, 5539, 16617, 49851.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49851 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49851 is composite. Its prime factorisation is
- 3
The divisors add up to 74880; without 49851 itself that is 25029, so 49851 is deficient (25029 is less than 49851). Euler's totient φ(49851) = 31920 numbers up to 49851 share no factor with it.
- 4
The digits of 49851 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49851 = 3^{2} \times 29 \times 191 \]49851 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 74880 |
| Euler totient φ(n) | 31920 |
| Square | 2485122201 |
| Cube | 123885826842051 |
| Square root | 223.273375 (= 3√5539) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9851 × |
49851 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand eight hundred and fifty-one |
| Binary (base 2) | 1100001010111011 |
| Octal (base 8) | 141273 |
| Hexadecimal (base 16) | C2BB |
| Base 3 | 2112101100 |
| As time | 49851 seconds = 13 h 50 min 51 s |
Is 49851 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 (49851 ÷ 3 = 16617) | 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 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 | Yes (49851 ÷ 9 = 5539) | 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 10) | 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 49851 a prime number?
No. 49851 = × 29 × 191, so it is divisible by 3.
What are the factors of 49851?
1, 3, 9, 29, 87, 191, 261, 573, 1719, 5539, 16617, 49851.
What is 49851 in binary?
1100001010111011 (hexadecimal C2BB, octal 141273).
What is the square root of 49851?
About 223.2734, exactly 3√5539.
Is 49851 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 49851?
It is a composite number with 12 divisors.