The number 49302
49302 is a composite number with 32 divisors. Its prime factorisation is 2 × × 11 × 83. Divisors (32): 1, 2, 3, 6, 9, 11, 18, 22, 27, 33, 54, 66, 83, 99, 166, 198 … 49302.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49302: a Harshad number: divisible by its digit sum 18.
- 2
49302 is composite. Its prime factorisation is
- 3
The divisors add up to 120960; without 49302 itself that is 71658, so 49302 is abundant (71658 is more than 49302). Euler's totient φ(49302) = 14760 numbers up to 49302 share no factor with it.
- 4
The digits of 49302 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49302 = 2 \times 3^{3} \times 11 \times 83 \]49302 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 120960 |
| Euler totient φ(n) | 14760 |
| Square | 2430687204 |
| Cube | 119837740531608 |
| Square root | 222.040537 (= 3√5478) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 39 |
| Scientific notation | 4.9302 × |
49302 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand three hundred and two |
| Binary (base 2) | 1100000010010110 |
| Octal (base 8) | 140226 |
| Hexadecimal (base 16) | C096 |
| Base 3 | 2111122000 |
| As time | 49302 seconds = 13 h 41 min 42 s |
Is 49302 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49302 ÷ 2 = 24651) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49302 ÷ 3 = 16434) | 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 (49302 ÷ 6 = 8217) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 | Yes (49302 ÷ 9 = 5478) | 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 | Yes (49302 ÷ 11 = 4482) | 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 49302 a prime number?
No. 49302 = 2 × × 11 × 83, so it is divisible by 2.
What are the factors of 49302?
1, 2, 3, 6, 9, 11, 18, 22, 27, 33, 54, 66, 83, 99, 166, 198, 249, 297, 498, 594, 747, 913, 1494, 1826, 2241, 2739, 4482, 5478, 8217, 16434, 24651, 49302.
What is 49302 in binary?
1100000010010110 (hexadecimal C096, octal 140226).
What is the square root of 49302?
About 222.0405, exactly 3√5478.
Is 49302 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 49302?
49302 is a Harshad number: divisible by its digit sum 18.