The number 49609
49609 is a composite number with 8 divisors. Its prime factorisation is 7 × 19 × 373. Divisors (8): 1, 7, 19, 133, 373, 2611, 7087, 49609.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49609 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49609 is composite. Its prime factorisation is
- 3
The divisors add up to 59840; without 49609 itself that is 10231, so 49609 is deficient (10231 is less than 49609). Euler's totient φ(49609) = 40176 numbers up to 49609 share no factor with it.
- 4
The digits of 49609 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49609 = 7 \times 19 \times 373 \]
49609 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 59840 |
| Euler totient φ(n) | 40176 |
| Square | 2461052881 |
| Cube | 122090372373529 |
| Square root | 222.730779 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.9609 × |
49609 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and nine |
| Binary (base 2) | 1100000111001001 |
| Octal (base 8) | 140711 |
| Hexadecimal (base 16) | C1C9 |
| Base 3 | 2112001101 |
| As time | 49609 seconds = 13 h 46 min 49 s |
Is 49609 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 1) | 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 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (49609 ÷ 7 = 7087) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49609 a prime number?
No. 49609 = 7 × 19 × 373, so it is divisible by 7.
What are the factors of 49609?
1, 7, 19, 133, 373, 2611, 7087, 49609.
What is 49609 in binary?
1100000111001001 (hexadecimal C1C9, octal 140711).
What is the square root of 49609?
About 222.7308.
Is 49609 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 49609?
It is a composite number with 8 divisors.