The number 49102
49102 is a composite number with 4 divisors. Its prime factorisation is 2 × 24551. Divisors (4): 1, 2, 24551, 49102.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49102: a semiprime: 2 × 24551, the product of two primes.
- 2
49102 is composite. Its prime factorisation is
- 3
The divisors add up to 73656; without 49102 itself that is 24554, so 49102 is deficient (24554 is less than 49102). Euler's totient φ(49102) = 24550 numbers up to 49102 share no factor with it.
- 4
The digits of 49102 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49102 = 2 \times 24551 \]
49102 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 73656 |
| Euler totient φ(n) | 24550 |
| Square | 2411006404 |
| Cube | 118385236449208 |
| Square root | 221.589711 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.9102 × |
49102 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and two |
| Binary (base 2) | 1011111111001110 |
| Octal (base 8) | 137716 |
| Hexadecimal (base 16) | BFCE |
| Base 3 | 2111100121 |
| As time | 49102 seconds = 13 h 38 min 22 s |
Is 49102 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49102 ÷ 2 = 24551) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49102 a prime number?
No. 49102 = 2 × 24551, so it is divisible by 2.
What are the factors of 49102?
1, 2, 24551, 49102.
What is 49102 in binary?
1011111111001110 (hexadecimal BFCE, octal 137716).
What is the square root of 49102?
About 221.5897.
Is 49102 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 49102?
49102 is a semiprime: 2 × 24551, the product of two primes.