The number 49950
49950 is a composite number with 48 divisors. Its prime factorisation is 2 × × × 37. Divisors (48): 1, 2, 3, 5, 6, 9, 10, 15, 18, 25, 27, 30, 37, 45, 50, 54 … 49950.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49950: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 27.
- 2
49950 is composite. Its prime factorisation is
- 3
The divisors add up to 141360; without 49950 itself that is 91410, so 49950 is abundant (91410 is more than 49950). Euler's totient φ(49950) = 12960 numbers up to 49950 share no factor with it.
- 4
The digits of 49950 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 88 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49950 = 2 \times 3^{3} \times 5^{2} \times 37 \]49950 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 141360 |
| Euler totient φ(n) | 12960 |
| Square | 2495002500 |
| Cube | 124625374875000 |
| Square root | 223.494966 (= 15√222) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 88 |
| Scientific notation | 4.995 × |
49950 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand nine hundred and fifty |
| Binary (base 2) | 1100001100011110 |
| Octal (base 8) | 141436 |
| Hexadecimal (base 16) | C31E |
| Base 3 | 2112112000 |
| As time | 49950 seconds = 13 h 52 min 30 s |
Is 49950 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49950 ÷ 2 = 24975) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49950 ÷ 3 = 16650) | 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 (49950 ÷ 5 = 9990) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (49950 ÷ 6 = 8325) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 | Yes (49950 ÷ 9 = 5550) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (49950 ÷ 10 = 4995) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49950 a prime number?
No. 49950 = 2 × × × 37, so it is divisible by 2.
What are the factors of 49950?
1, 2, 3, 5, 6, 9, 10, 15, 18, 25, 27, 30, 37, 45, 50, 54, 74, 75, 90, 111, 135, 150, 185, 222, 225, 270, 333, 370, 450, 555, 666, 675, 925, 999, 1110, 1350, 1665, 1850, 1998, 2775, 3330, 4995, 5550, 8325, 9990, 16650, 24975, 49950.
What is 49950 in binary?
1100001100011110 (hexadecimal C31E, octal 141436).
What is the square root of 49950?
About 223.4950, exactly 15√222.
Is 49950 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 49950?
49950 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 27.