The number 49601
49601 is a composite number with 4 divisors. Its prime factorisation is 193 × 257. Divisors (4): 1, 193, 257, 49601.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49601: a semiprime: 193 × 257, the product of two primes.
- 2
49601 is composite. Its prime factorisation is
- 3
The divisors add up to 50052; without 49601 itself that is 451, so 49601 is deficient (451 is less than 49601). Euler's totient φ(49601) = 49152 numbers up to 49601 share no factor with it.
- 4
The digits of 49601 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 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49601 = 193 \times 257 \]
49601 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50052 |
| Euler totient φ(n) | 49152 |
| Square | 2460259201 |
| Cube | 122031316628801 |
| Square root | 222.712820 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 140 |
| Scientific notation | 4.9601 × |
49601 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and one |
| Binary (base 2) | 1100000111000001 |
| Octal (base 8) | 140701 |
| Hexadecimal (base 16) | C1C1 |
| Base 3 | 2112001002 |
| As time | 49601 seconds = 13 h 46 min 41 s |
Is 49601 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 | No (remainder 1) | 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 6) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 49601 a prime number?
No. 49601 = 193 × 257, so it is divisible by 193.
What are the factors of 49601?
1, 193, 257, 49601.
What is 49601 in binary?
1100000111000001 (hexadecimal C1C1, octal 140701).
What is the square root of 49601?
About 222.7128.
Is 49601 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 49601?
49601 is a semiprime: 193 × 257, the product of two primes.