The number 49604
49604 is a composite number with 6 divisors. Its prime factorisation is × 12401. Divisors (6): 1, 2, 4, 12401, 24802, 49604.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49604 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49604 is composite. Its prime factorisation is
- 3
The divisors add up to 86814; without 49604 itself that is 37210, so 49604 is deficient (37210 is less than 49604). Euler's totient φ(49604) = 24800 numbers up to 49604 share no factor with it.
- 4
The digits of 49604 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49604 = 2^{2} \times 12401 \]49604 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 86814 |
| Euler totient φ(n) | 24800 |
| Square | 2460556816 |
| Cube | 122053460300864 |
| Square root | 222.719555 (= 2√12401) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.9604 × |
49604 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and four |
| Binary (base 2) | 1100000111000100 |
| Octal (base 8) | 140704 |
| Hexadecimal (base 16) | C1C4 |
| Base 3 | 2112001012 |
| As time | 49604 seconds = 13 h 46 min 44 s |
Is 49604 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49604 ÷ 2 = 24802) | 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 | Yes (49604 ÷ 4 = 12401) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49604 a prime number?
No. 49604 = × 12401, so it is divisible by 2.
What are the factors of 49604?
1, 2, 4, 12401, 24802, 49604.
What is 49604 in binary?
1100000111000100 (hexadecimal C1C4, octal 140704).
What is the square root of 49604?
About 222.7196, exactly 2√12401.
Is 49604 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 49604?
It is a composite number with 6 divisors.