The number 49598
49598 is a composite number with 4 divisors. Its prime factorisation is 2 × 24799. Divisors (4): 1, 2, 24799, 49598.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49598: a semiprime: 2 × 24799, the product of two primes.
- 2
49598 is composite. Its prime factorisation is
- 3
The divisors add up to 74400; without 49598 itself that is 24802, so 49598 is deficient (24802 is less than 49598). Euler's totient φ(49598) = 24798 numbers up to 49598 share no factor with it.
- 4
The digits of 49598 add up to 35, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 264 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49598 = 2 \times 24799 \]
49598 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 74400 |
| Euler totient φ(n) | 24798 |
| Square | 2459961604 |
| Cube | 122009175635192 |
| Square root | 222.706084 |
| Digit sum / digital root | 35 / 8 |
| Collatz steps to 1 | 264 |
| Scientific notation | 4.9598 × |
49598 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and ninety-eight |
| Binary (base 2) | 1100000110111110 |
| Octal (base 8) | 140676 |
| Hexadecimal (base 16) | C1BE |
| Base 3 | 2112000222 |
| As time | 49598 seconds = 13 h 46 min 38 s |
Is 49598 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49598 ÷ 2 = 24799) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49598 a prime number?
No. 49598 = 2 × 24799, so it is divisible by 2.
What are the factors of 49598?
1, 2, 24799, 49598.
What is 49598 in binary?
1100000110111110 (hexadecimal C1BE, octal 140676).
What is the square root of 49598?
About 222.7061.
Is 49598 divisible by 3?
No. Its digits add up to 35, which is not a multiple of 3.
What is special about the number 49598?
49598 is a semiprime: 2 × 24799, the product of two primes.