The number 49160
49160 is a composite number with 16 divisors. Its prime factorisation is × 5 × 1229. Divisors (16): 1, 2, 4, 5, 8, 10, 20, 40, 1229, 2458, 4916, 6145, 9832, 12290, 24580, 49160.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49160: a Harshad number: divisible by its digit sum 20.
- 2
49160 is composite. Its prime factorisation is
- 3
The divisors add up to 110700; without 49160 itself that is 61540, so 49160 is abundant (61540 is more than 49160). Euler's totient φ(49160) = 19648 numbers up to 49160 share no factor with it.
- 4
The digits of 49160 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49160 = 2^{3} \times 5 \times 1229 \]49160 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 110700 |
| Euler totient φ(n) | 19648 |
| Square | 2416705600 |
| Cube | 118805247296000 |
| Square root | 221.720545 (= 2√12290) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.916 × |
49160 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and sixty |
| Binary (base 2) | 1100000000001000 |
| Octal (base 8) | 140010 |
| Hexadecimal (base 16) | C008 |
| Base 3 | 2111102202 |
| As time | 49160 seconds = 13 h 39 min 20 s |
Is 49160 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49160 ÷ 2 = 24580) | 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 | Yes (49160 ÷ 4 = 12290) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (49160 ÷ 5 = 9832) | 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 6) | 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 | Yes (49160 ÷ 8 = 6145) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (49160 ÷ 10 = 4916) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49160 a prime number?
No. 49160 = × 5 × 1229, so it is divisible by 2.
What are the factors of 49160?
1, 2, 4, 5, 8, 10, 20, 40, 1229, 2458, 4916, 6145, 9832, 12290, 24580, 49160.
What is 49160 in binary?
1100000000001000 (hexadecimal C008, octal 140010).
What is the square root of 49160?
About 221.7205, exactly 2√12290.
Is 49160 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 49160?
49160 is a Harshad number: divisible by its digit sum 20.