The number 49558
49558 is a composite number with 8 divisors. Its prime factorisation is 2 × 71 × 349. Divisors (8): 1, 2, 71, 142, 349, 698, 24779, 49558.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49558 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49558 is composite. Its prime factorisation is
- 3
The divisors add up to 75600; without 49558 itself that is 26042, so 49558 is deficient (26042 is less than 49558). Euler's totient φ(49558) = 24360 numbers up to 49558 share no factor with it.
- 4
The digits of 49558 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49558 = 2 \times 71 \times 349 \]
49558 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 75600 |
| Euler totient φ(n) | 24360 |
| Square | 2455995364 |
| Cube | 121714218249112 |
| Square root | 222.616262 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.9558 × |
49558 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and fifty-eight |
| Binary (base 2) | 1100000110010110 |
| Octal (base 8) | 140626 |
| Hexadecimal (base 16) | C196 |
| Base 3 | 2111222111 |
| As time | 49558 seconds = 13 h 45 min 58 s |
Is 49558 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49558 ÷ 2 = 24779) | 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 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 4) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49558 a prime number?
No. 49558 = 2 × 71 × 349, so it is divisible by 2.
What are the factors of 49558?
1, 2, 71, 142, 349, 698, 24779, 49558.
What is 49558 in binary?
1100000110010110 (hexadecimal C196, octal 140626).
What is the square root of 49558?
About 222.6163.
Is 49558 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 49558?
It is a composite number with 8 divisors.