The number 49750
49750 is a composite number with 16 divisors. Its prime factorisation is 2 × × 199. Divisors (16): 1, 2, 5, 10, 25, 50, 125, 199, 250, 398, 995, 1990, 4975, 9950, 24875, 49750.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49750: a Harshad number: divisible by its digit sum 25.
- 2
49750 is composite. Its prime factorisation is
- 3
The divisors add up to 93600; without 49750 itself that is 43850, so 49750 is deficient (43850 is less than 49750). Euler's totient φ(49750) = 19800 numbers up to 49750 share no factor with it.
- 4
The digits of 49750 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49750 = 2 \times 5^{3} \times 199 \]49750 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 93600 |
| Euler totient φ(n) | 19800 |
| Square | 2475062500 |
| Cube | 123134359375000 |
| Square root | 223.047080 (= 5√1990) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.975 × |
49750 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand seven hundred and fifty |
| Binary (base 2) | 1100001001010110 |
| Octal (base 8) | 141126 |
| Hexadecimal (base 16) | C256 |
| Base 3 | 2112020121 |
| As time | 49750 seconds = 13 h 49 min 10 s |
Is 49750 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49750 ÷ 2 = 24875) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (49750 ÷ 5 = 9950) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (49750 ÷ 10 = 4975) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49750 a prime number?
No. 49750 = 2 × × 199, so it is divisible by 2.
What are the factors of 49750?
1, 2, 5, 10, 25, 50, 125, 199, 250, 398, 995, 1990, 4975, 9950, 24875, 49750.
What is 49750 in binary?
1100001001010110 (hexadecimal C256, octal 141126).
What is the square root of 49750?
About 223.0471, exactly 5√1990.
Is 49750 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49750?
49750 is a Harshad number: divisible by its digit sum 25.