The number 49262
49262 is a composite number with 4 divisors. Its prime factorisation is 2 × 24631. Divisors (4): 1, 2, 24631, 49262.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49262: a semiprime: 2 × 24631, the product of two primes.
- 2
49262 is composite. Its prime factorisation is
- 3
The divisors add up to 73896; without 49262 itself that is 24634, so 49262 is deficient (24634 is less than 49262). Euler's totient φ(49262) = 24630 numbers up to 49262 share no factor with it.
- 4
The digits of 49262 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49262 = 2 \times 24631 \]
49262 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 73896 |
| Euler totient φ(n) | 24630 |
| Square | 2426744644 |
| Cube | 119546294652728 |
| Square root | 221.950445 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9262 × |
49262 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand two hundred and sixty-two |
| Binary (base 2) | 1100000001101110 |
| Octal (base 8) | 140156 |
| Hexadecimal (base 16) | C06E |
| Base 3 | 2111120112 |
| As time | 49262 seconds = 13 h 41 min 2 s |
Is 49262 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49262 ÷ 2 = 24631) | 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 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 | No (remainder 3) | 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 5) | 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 4) | 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 49262 a prime number?
No. 49262 = 2 × 24631, so it is divisible by 2.
What are the factors of 49262?
1, 2, 24631, 49262.
What is 49262 in binary?
1100000001101110 (hexadecimal C06E, octal 140156).
What is the square root of 49262?
About 221.9504.
Is 49262 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 49262?
49262 is a semiprime: 2 × 24631, the product of two primes.