The number 49951
49951 is a composite number with 8 divisors. Its prime factorisation is 11 × 19 × 239. Divisors (8): 1, 11, 19, 209, 239, 2629, 4541, 49951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49951 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49951 is composite. Its prime factorisation is
- 3
The divisors add up to 57600; without 49951 itself that is 7649, so 49951 is deficient (7649 is less than 49951). Euler's totient φ(49951) = 42840 numbers up to 49951 share no factor with it.
- 4
The digits of 49951 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49951 = 11 \times 19 \times 239 \]
49951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 57600 |
| Euler totient φ(n) | 42840 |
| Square | 2495102401 |
| Cube | 124632860032351 |
| Square root | 223.497204 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9951 × |
49951 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand nine hundred and fifty-one |
| Binary (base 2) | 1100001100011111 |
| Octal (base 8) | 141437 |
| Hexadecimal (base 16) | C31F |
| Base 3 | 2112112001 |
| As time | 49951 seconds = 13 h 52 min 31 s |
Is 49951 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 | No (remainder 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 | Yes (49951 ÷ 11 = 4541) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49951 a prime number?
No. 49951 = 11 × 19 × 239, so it is divisible by 11.
What are the factors of 49951?
1, 11, 19, 209, 239, 2629, 4541, 49951.
What is 49951 in binary?
1100001100011111 (hexadecimal C31F, octal 141437).
What is the square root of 49951?
About 223.4972.
Is 49951 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 49951?
It is a composite number with 8 divisors.