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