The number 49579
49579 is a composite number with 4 divisors. Its prime factorisation is 43 × 1153. Divisors (4): 1, 43, 1153, 49579.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49579: a semiprime: 43 × 1153, the product of two primes.
- 2
49579 is composite. Its prime factorisation is
- 3
The divisors add up to 50776; without 49579 itself that is 1197, so 49579 is deficient (1197 is less than 49579). Euler's totient φ(49579) = 48384 numbers up to 49579 share no factor with it.
- 4
The digits of 49579 add up to 34, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49579 = 43 \times 1153 \]
49579 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50776 |
| Euler totient φ(n) | 48384 |
| Square | 2458077241 |
| Cube | 121869011531539 |
| Square root | 222.663423 |
| Digit sum / digital root | 34 / 7 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9579 × |
49579 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and seventy-nine |
| Binary (base 2) | 1100000110101011 |
| Octal (base 8) | 140653 |
| Hexadecimal (base 16) | C1AB |
| Base 3 | 2112000021 |
| As time | 49579 seconds = 13 h 46 min 19 s |
Is 49579 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 3) | 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 | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49579 a prime number?
No. 49579 = 43 × 1153, so it is divisible by 43.
What are the factors of 49579?
1, 43, 1153, 49579.
What is 49579 in binary?
1100000110101011 (hexadecimal C1AB, octal 140653).
What is the square root of 49579?
About 222.6634.
Is 49579 divisible by 3?
No. Its digits add up to 34, which is not a multiple of 3.
What is special about the number 49579?
49579 is a semiprime: 43 × 1153, the product of two primes.