The number 49605
49605 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 3307. Divisors (8): 1, 3, 5, 15, 3307, 9921, 16535, 49605.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49605 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49605 is composite. Its prime factorisation is
- 3
The divisors add up to 79392; without 49605 itself that is 29787, so 49605 is deficient (29787 is less than 49605). Euler's totient φ(49605) = 26448 numbers up to 49605 share no factor with it.
- 4
The digits of 49605 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 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49605 = 3 \times 5 \times 3307 \]
49605 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 79392 |
| Euler totient φ(n) | 26448 |
| Square | 2460656025 |
| Cube | 122060842120125 |
| Square root | 222.721800 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.9605 × |
49605 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and five |
| Binary (base 2) | 1100000111000101 |
| Octal (base 8) | 140705 |
| Hexadecimal (base 16) | C1C5 |
| Base 3 | 2112001020 |
| As time | 49605 seconds = 13 h 46 min 45 s |
Is 49605 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 | Yes (49605 ÷ 3 = 16535) | 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 (49605 ÷ 5 = 9921) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 6) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49605 a prime number?
No. 49605 = 3 × 5 × 3307, so it is divisible by 3.
What are the factors of 49605?
1, 3, 5, 15, 3307, 9921, 16535, 49605.
What is 49605 in binary?
1100000111000101 (hexadecimal C1C5, octal 140705).
What is the square root of 49605?
About 222.7218.
Is 49605 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 49605?
It is a composite number with 8 divisors.