The number 49106
49106 is a composite number with 8 divisors. Its prime factorisation is 2 × 43 × 571. Divisors (8): 1, 2, 43, 86, 571, 1142, 24553, 49106.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49106 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49106 is composite. Its prime factorisation is
- 3
The divisors add up to 75504; without 49106 itself that is 26398, so 49106 is deficient (26398 is less than 49106). Euler's totient φ(49106) = 23940 numbers up to 49106 share no factor with it.
- 4
The digits of 49106 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 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49106 = 2 \times 43 \times 571 \]
49106 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 75504 |
| Euler totient φ(n) | 23940 |
| Square | 2411399236 |
| Cube | 118414170883016 |
| Square root | 221.598736 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.9106 × |
49106 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and six |
| Binary (base 2) | 1011111111010010 |
| Octal (base 8) | 137722 |
| Hexadecimal (base 16) | BFD2 |
| Base 3 | 2111100202 |
| As time | 49106 seconds = 13 h 38 min 26 s |
Is 49106 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49106 ÷ 2 = 24553) | 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 | No (remainder 1) | 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 1) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 49106 a prime number?
No. 49106 = 2 × 43 × 571, so it is divisible by 2.
What are the factors of 49106?
1, 2, 43, 86, 571, 1142, 24553, 49106.
What is 49106 in binary?
1011111111010010 (hexadecimal BFD2, octal 137722).
What is the square root of 49106?
About 221.5987.
Is 49106 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 49106?
It is a composite number with 8 divisors.