The number 49110
49110 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 1637. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 1637, 3274, 4911, 8185, 9822, 16370, 24555, 49110.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49110: a Harshad number: divisible by its digit sum 15.
- 2
49110 is composite. Its prime factorisation is
- 3
The divisors add up to 117936; without 49110 itself that is 68826, so 49110 is abundant (68826 is more than 49110). Euler's totient φ(49110) = 13088 numbers up to 49110 share no factor with it.
- 4
The digits of 49110 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49110 = 2 \times 3 \times 5 \times 1637 \]
49110 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 117936 |
| Euler totient φ(n) | 13088 |
| Square | 2411792100 |
| Cube | 118443110031000 |
| Square root | 221.607762 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.911 × |
49110 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and ten |
| Binary (base 2) | 1011111111010110 |
| Octal (base 8) | 137726 |
| Hexadecimal (base 16) | BFD6 |
| Base 3 | 2111100220 |
| As time | 49110 seconds = 13 h 38 min 30 s |
Is 49110 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49110 ÷ 2 = 24555) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49110 ÷ 3 = 16370) | 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 (49110 ÷ 5 = 9822) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (49110 ÷ 6 = 8185) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (49110 ÷ 10 = 4911) | 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 49110 a prime number?
No. 49110 = 2 × 3 × 5 × 1637, so it is divisible by 2.
What are the factors of 49110?
1, 2, 3, 5, 6, 10, 15, 30, 1637, 3274, 4911, 8185, 9822, 16370, 24555, 49110.
What is 49110 in binary?
1011111111010110 (hexadecimal BFD6, octal 137726).
What is the square root of 49110?
About 221.6078.
Is 49110 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 49110?
49110 is a Harshad number: divisible by its digit sum 15.