The number 49751
49751 is a composite number with 8 divisors. Its prime factorisation is 13 × 43 × 89. Divisors (8): 1, 13, 43, 89, 559, 1157, 3827, 49751.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49751 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49751 is composite. Its prime factorisation is
- 3
The divisors add up to 55440; without 49751 itself that is 5689, so 49751 is deficient (5689 is less than 49751). Euler's totient φ(49751) = 44352 numbers up to 49751 share no factor with it.
- 4
The digits of 49751 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49751 = 13 \times 43 \times 89 \]
49751 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 55440 |
| Euler totient φ(n) | 44352 |
| Square | 2475162001 |
| Cube | 123141784711751 |
| Square root | 223.049322 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9751 × |
49751 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand seven hundred and fifty-one |
| Binary (base 2) | 1100001001010111 |
| Octal (base 8) | 141127 |
| Hexadecimal (base 16) | C257 |
| Base 3 | 2112020122 |
| As time | 49751 seconds = 13 h 49 min 11 s |
Is 49751 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 2) | 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 5) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49751 a prime number?
No. 49751 = 13 × 43 × 89, so it is divisible by 13.
What are the factors of 49751?
1, 13, 43, 89, 559, 1157, 3827, 49751.
What is 49751 in binary?
1100001001010111 (hexadecimal C257, octal 141127).
What is the square root of 49751?
About 223.0493.
Is 49751 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 49751?
It is a composite number with 8 divisors.