The number 49170
49170 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 5 × 11 × 149. Divisors (32): 1, 2, 3, 5, 6, 10, 11, 15, 22, 30, 33, 55, 66, 110, 149, 165 … 49170.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49170 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49170 is composite. Its prime factorisation is
- 3
The divisors add up to 129600; without 49170 itself that is 80430, so 49170 is abundant (80430 is more than 49170). Euler's totient φ(49170) = 11840 numbers up to 49170 share no factor with it.
- 4
The digits of 49170 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49170 = 2 \times 3 \times 5 \times 11 \times 149 \]
49170 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 129600 |
| Euler totient φ(n) | 11840 |
| Square | 2417688900 |
| Cube | 118877763213000 |
| Square root | 221.743095 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.917 × |
49170 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and seventy |
| Binary (base 2) | 1100000000010010 |
| Octal (base 8) | 140022 |
| Hexadecimal (base 16) | C012 |
| Base 3 | 2111110010 |
| As time | 49170 seconds = 13 h 39 min 30 s |
Is 49170 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49170 ÷ 2 = 24585) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49170 ÷ 3 = 16390) | 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 (49170 ÷ 5 = 9834) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (49170 ÷ 6 = 8195) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (49170 ÷ 10 = 4917) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (49170 ÷ 11 = 4470) | 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 49170 a prime number?
No. 49170 = 2 × 3 × 5 × 11 × 149, so it is divisible by 2.
What are the factors of 49170?
1, 2, 3, 5, 6, 10, 11, 15, 22, 30, 33, 55, 66, 110, 149, 165, 298, 330, 447, 745, 894, 1490, 1639, 2235, 3278, 4470, 4917, 8195, 9834, 16390, 24585, 49170.
What is 49170 in binary?
1100000000010010 (hexadecimal C012, octal 140022).
What is the square root of 49170?
About 221.7431.
Is 49170 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 49170?
It is a composite number with 32 divisors.