The number 49130
49130 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × . Divisors (16): 1, 2, 5, 10, 17, 34, 85, 170, 289, 578, 1445, 2890, 4913, 9826, 24565, 49130.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49130: a Harshad number: divisible by its digit sum 17.
- 2
49130 is composite. Its prime factorisation is
- 3
The divisors add up to 93960; without 49130 itself that is 44830, so 49130 is deficient (44830 is less than 49130). Euler's totient φ(49130) = 18496 numbers up to 49130 share no factor with it.
- 4
The digits of 49130 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49130 = 2 \times 5 \times 17^{3} \]49130 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 93960 |
| Euler totient φ(n) | 18496 |
| Square | 2413756900 |
| Cube | 118587876497000 |
| Square root | 221.652882 (= 17√170) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.913 × |
49130 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and thirty |
| Binary (base 2) | 1011111111101010 |
| Octal (base 8) | 137752 |
| Hexadecimal (base 16) | BFEA |
| Base 3 | 2111101122 |
| As time | 49130 seconds = 13 h 38 min 50 s |
Is 49130 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49130 ÷ 2 = 24565) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 (49130 ÷ 5 = 9826) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (49130 ÷ 10 = 4913) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49130 a prime number?
No. 49130 = 2 × 5 × , so it is divisible by 2.
What are the factors of 49130?
1, 2, 5, 10, 17, 34, 85, 170, 289, 578, 1445, 2890, 4913, 9826, 24565, 49130.
What is 49130 in binary?
1011111111101010 (hexadecimal BFEA, octal 137752).
What is the square root of 49130?
About 221.6529, exactly 17√170.
Is 49130 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 49130?
49130 is a Harshad number: divisible by its digit sum 17.