The number 49112
49112 is a composite number with 16 divisors. Its prime factorisation is × 7 × 877. Divisors (16): 1, 2, 4, 7, 8, 14, 28, 56, 877, 1754, 3508, 6139, 7016, 12278, 24556, 49112.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49112: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
49112 is composite. Its prime factorisation is
- 3
The divisors add up to 105360; without 49112 itself that is 56248, so 49112 is abundant (56248 is more than 49112). Euler's totient φ(49112) = 21024 numbers up to 49112 share no factor with it.
- 4
The digits of 49112 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 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49112 = 2^{3} \times 7 \times 877 \]49112 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 105360 |
| Euler totient φ(n) | 21024 |
| Square | 2411988544 |
| Cube | 118457581372928 |
| Square root | 221.612274 (= 2√12278) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.9112 × |
49112 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and twelve |
| Binary (base 2) | 1011111111011000 |
| Octal (base 8) | 137730 |
| Hexadecimal (base 16) | BFD8 |
| Base 3 | 2111100222 |
| As time | 49112 seconds = 13 h 38 min 32 s |
Is 49112 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49112 ÷ 2 = 24556) | 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 (49112 ÷ 4 = 12278) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 | Yes (49112 ÷ 7 = 7016) | 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 (49112 ÷ 8 = 6139) | 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 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 49112 a prime number?
No. 49112 = × 7 × 877, so it is divisible by 2.
What are the factors of 49112?
1, 2, 4, 7, 8, 14, 28, 56, 877, 1754, 3508, 6139, 7016, 12278, 24556, 49112.
What is 49112 in binary?
1011111111011000 (hexadecimal BFD8, octal 137730).
What is the square root of 49112?
About 221.6123, exactly 2√12278.
Is 49112 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 49112?
49112 is a happy number: repeatedly adding the squares of its digits reaches 1.