The number 49602
49602 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 7 × 1181. Divisors (16): 1, 2, 3, 6, 7, 14, 21, 42, 1181, 2362, 3543, 7086, 8267, 16534, 24801, 49602.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49602: a Harshad number: divisible by its digit sum 21.
- 2
49602 is composite. Its prime factorisation is
- 3
The divisors add up to 113472; without 49602 itself that is 63870, so 49602 is abundant (63870 is more than 49602). Euler's totient φ(49602) = 14160 numbers up to 49602 share no factor with it.
- 4
The digits of 49602 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49602 = 2 \times 3 \times 7 \times 1181 \]
49602 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 113472 |
| Euler totient φ(n) | 14160 |
| Square | 2460358404 |
| Cube | 122038697555208 |
| Square root | 222.715065 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9602 × |
49602 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and two |
| Binary (base 2) | 1100000111000010 |
| Octal (base 8) | 140702 |
| Hexadecimal (base 16) | C1C2 |
| Base 3 | 2112001010 |
| As time | 49602 seconds = 13 h 46 min 42 s |
Is 49602 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49602 ÷ 2 = 24801) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49602 ÷ 3 = 16534) | 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 (49602 ÷ 6 = 8267) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (49602 ÷ 7 = 7086) | 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 3) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49602 a prime number?
No. 49602 = 2 × 3 × 7 × 1181, so it is divisible by 2.
What are the factors of 49602?
1, 2, 3, 6, 7, 14, 21, 42, 1181, 2362, 3543, 7086, 8267, 16534, 24801, 49602.
What is 49602 in binary?
1100000111000010 (hexadecimal C1C2, octal 140702).
What is the square root of 49602?
About 222.7151.
Is 49602 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 49602?
49602 is a Harshad number: divisible by its digit sum 21.