The number 49770
49770 is a triangular number: 1 + 2 + … + 315 = 49770. Its prime factorisation is 2 × × 5 × 7 × 79. Divisors (48): 1, 2, 3, 5, 6, 7, 9, 10, 14, 15, 18, 21, 30, 35, 42, 45 … 49770.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49770: a triangular number: 1 + 2 + … + 315 = 49770.
- 2
49770 is composite. Its prime factorisation is
- 3
The divisors add up to 149760; without 49770 itself that is 99990, so 49770 is abundant (99990 is more than 49770). Euler's totient φ(49770) = 11232 numbers up to 49770 share no factor with it.
- 4
The digits of 49770 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 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49770 = 2 \times 3^{2} \times 5 \times 7 \times 79 \]49770 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 149760 |
| Euler totient φ(n) | 11232 |
| Square | 2477052900 |
| Cube | 123282922833000 |
| Square root | 223.091909 (= 3√5530) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 39 |
| Scientific notation | 4.977 × |
49770 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand seven hundred and seventy |
| Binary (base 2) | 1100001001101010 |
| Octal (base 8) | 141152 |
| Hexadecimal (base 16) | C26A |
| Base 3 | 2112021100 |
| As time | 49770 seconds = 13 h 49 min 30 s |
Is 49770 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49770 ÷ 2 = 24885) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49770 ÷ 3 = 16590) | 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 (49770 ÷ 5 = 9954) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (49770 ÷ 6 = 8295) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (49770 ÷ 7 = 7110) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (49770 ÷ 9 = 5530) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (49770 ÷ 10 = 4977) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 49770 a prime number?
No. 49770 = 2 × × 5 × 7 × 79, so it is divisible by 2.
What are the factors of 49770?
1, 2, 3, 5, 6, 7, 9, 10, 14, 15, 18, 21, 30, 35, 42, 45, 63, 70, 79, 90, 105, 126, 158, 210, 237, 315, 395, 474, 553, 630, 711, 790, 1106, 1185, 1422, 1659, 2370, 2765, 3318, 3555, 4977, 5530, 7110, 8295, 9954, 16590, 24885, 49770.
What is 49770 in binary?
1100001001101010 (hexadecimal C26A, octal 141152).
What is the square root of 49770?
About 223.0919, exactly 3√5530.
Is 49770 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 49770?
49770 is a triangular number: 1 + 2 + … + 315 = 49770.