The number 49362
49362 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 19 × 433. Divisors (16): 1, 2, 3, 6, 19, 38, 57, 114, 433, 866, 1299, 2598, 8227, 16454, 24681, 49362.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49362 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49362 is composite. Its prime factorisation is
- 3
The divisors add up to 104160; without 49362 itself that is 54798, so 49362 is abundant (54798 is more than 49362). Euler's totient φ(49362) = 15552 numbers up to 49362 share no factor with it.
- 4
The digits of 49362 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49362 = 2 \times 3 \times 19 \times 433 \]
49362 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 104160 |
| Euler totient φ(n) | 15552 |
| Square | 2436607044 |
| Cube | 120275796905928 |
| Square root | 222.175606 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9362 × |
49362 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand three hundred and sixty-two |
| Binary (base 2) | 1100000011010010 |
| Octal (base 8) | 140322 |
| Hexadecimal (base 16) | C0D2 |
| Base 3 | 2111201020 |
| As time | 49362 seconds = 13 h 42 min 42 s |
Is 49362 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49362 ÷ 2 = 24681) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49362 ÷ 3 = 16454) | 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 | Yes (49362 ÷ 6 = 8227) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 6) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49362 a prime number?
No. 49362 = 2 × 3 × 19 × 433, so it is divisible by 2.
What are the factors of 49362?
1, 2, 3, 6, 19, 38, 57, 114, 433, 866, 1299, 2598, 8227, 16454, 24681, 49362.
What is 49362 in binary?
1100000011010010 (hexadecimal C0D2, octal 140322).
What is the square root of 49362?
About 222.1756.
Is 49362 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 49362?
It is a composite number with 16 divisors.