The number 4950
4950 is a triangular number: 1 + 2 + … + 99 = 4950. Its prime factorisation is 2 × × × 11. Divisors (36): 1, 2, 3, 5, 6, 9, 10, 11, 15, 18, 22, 25, 30, 33, 45, 50 … 4950.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4950: a triangular number: 1 + 2 + … + 99 = 4950; a Harshad number: divisible by its digit sum 18.
- 2
4950 is composite. Its prime factorisation is
- 3
The divisors add up to 14508; without 4950 itself that is 9558, so 4950 is abundant (9558 is more than 4950). Euler's totient φ(4950) = 1200 numbers up to 4950 share no factor with it.
- 4
The digits of 4950 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 72 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4950 = 2 \times 3^{2} \times 5^{2} \times 11 \]4950 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 36 |
| Sum of divisors | 14508 |
| Euler totient φ(n) | 1200 |
| Square | 24502500 |
| Cube | 121287375000 |
| Square root | 70.356236 (= 15√22) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 72 |
| Scientific notation | 4.95 × |
4950 in other forms
| Form | Value |
|---|---|
| In words | four thousand nine hundred and fifty |
| Binary (base 2) | 1001101010110 |
| Octal (base 8) | 11526 |
| Hexadecimal (base 16) | 1356 |
| Base 3 | 20210100 |
| As time | 4950 seconds = 1 h 22 min 30 s |
Is 4950 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (4950 ÷ 2 = 2475) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (4950 ÷ 3 = 1650) | 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 (4950 ÷ 5 = 990) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (4950 ÷ 6 = 825) | 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 | Yes (4950 ÷ 9 = 550) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (4950 ÷ 10 = 495) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (4950 ÷ 11 = 450) | 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 4950 a prime number?
No. 4950 = 2 × × × 11, so it is divisible by 2.
What are the factors of 4950?
1, 2, 3, 5, 6, 9, 10, 11, 15, 18, 22, 25, 30, 33, 45, 50, 55, 66, 75, 90, 99, 110, 150, 165, 198, 225, 275, 330, 450, 495, 550, 825, 990, 1650, 2475, 4950.
What is 4950 in binary?
1001101010110 (hexadecimal 1356, octal 11526).
What is the square root of 4950?
About 70.3562, exactly 15√22.
Is 4950 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 4950?
4950 is a triangular number: 1 + 2 + … + 99 = 4950; a Harshad number: divisible by its digit sum 18.