The number 49382
49382 is a composite number with 4 divisors. Its prime factorisation is 2 × 24691. Divisors (4): 1, 2, 24691, 49382.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49382: a semiprime: 2 × 24691, the product of two primes.
- 2
49382 is composite. Its prime factorisation is
- 3
The divisors add up to 74076; without 49382 itself that is 24694, so 49382 is deficient (24694 is less than 49382). Euler's totient φ(49382) = 24690 numbers up to 49382 share no factor with it.
- 4
The digits of 49382 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 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49382 = 2 \times 24691 \]
49382 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 74076 |
| Euler totient φ(n) | 24690 |
| Square | 2438581924 |
| Cube | 120422052570968 |
| Square root | 222.220611 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.9382 × |
49382 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand three hundred and eighty-two |
| Binary (base 2) | 1100000011100110 |
| Octal (base 8) | 140346 |
| Hexadecimal (base 16) | C0E6 |
| Base 3 | 2111201222 |
| As time | 49382 seconds = 13 h 43 min 2 s |
Is 49382 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49382 ÷ 2 = 24691) | 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 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 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 3) | 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 49382 a prime number?
No. 49382 = 2 × 24691, so it is divisible by 2.
What are the factors of 49382?
1, 2, 24691, 49382.
What is 49382 in binary?
1100000011100110 (hexadecimal C0E6, octal 140346).
What is the square root of 49382?
About 222.2206.
Is 49382 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 49382?
49382 is a semiprime: 2 × 24691, the product of two primes.