The number 49205
49205 is a composite number with 8 divisors. Its prime factorisation is 5 × 13 × 757. Divisors (8): 1, 5, 13, 65, 757, 3785, 9841, 49205.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49205 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49205 is composite. Its prime factorisation is
- 3
The divisors add up to 63672; without 49205 itself that is 14467, so 49205 is deficient (14467 is less than 49205). Euler's totient φ(49205) = 36288 numbers up to 49205 share no factor with it.
- 4
The digits of 49205 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49205 = 5 \times 13 \times 757 \]
49205 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 63672 |
| Euler totient φ(n) | 36288 |
| Square | 2421132025 |
| Cube | 119131801290125 |
| Square root | 221.822001 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9205 × |
49205 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand two hundred and five |
| Binary (base 2) | 1100000000110101 |
| Octal (base 8) | 140065 |
| Hexadecimal (base 16) | C035 |
| Base 3 | 2111111102 |
| As time | 49205 seconds = 13 h 40 min 5 s |
Is 49205 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (49205 ÷ 5 = 9841) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49205 a prime number?
No. 49205 = 5 × 13 × 757, so it is divisible by 5.
What are the factors of 49205?
1, 5, 13, 65, 757, 3785, 9841, 49205.
What is 49205 in binary?
1100000000110101 (hexadecimal C035, octal 140065).
What is the square root of 49205?
About 221.8220.
Is 49205 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 49205?
It is a composite number with 8 divisors.