The number 49587
49587 is a composite number with 4 divisors. Its prime factorisation is 3 × 16529. Divisors (4): 1, 3, 16529, 49587.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49587: a semiprime: 3 × 16529, the product of two primes.
- 2
49587 is composite. Its prime factorisation is
- 3
The divisors add up to 66120; without 49587 itself that is 16533, so 49587 is deficient (16533 is less than 49587). Euler's totient φ(49587) = 33056 numbers up to 49587 share no factor with it.
- 4
The digits of 49587 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49587 = 3 \times 16529 \]
49587 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 66120 |
| Euler totient φ(n) | 33056 |
| Square | 2458870569 |
| Cube | 121928014905003 |
| Square root | 222.681387 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.9587 × |
49587 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and eighty-seven |
| Binary (base 2) | 1100000110110011 |
| Octal (base 8) | 140663 |
| Hexadecimal (base 16) | C1B3 |
| Base 3 | 2112000120 |
| As time | 49587 seconds = 13 h 46 min 27 s |
Is 49587 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 | Yes (49587 ÷ 3 = 16529) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49587 a prime number?
No. 49587 = 3 × 16529, so it is divisible by 3.
What are the factors of 49587?
1, 3, 16529, 49587.
What is 49587 in binary?
1100000110110011 (hexadecimal C1B3, octal 140663).
What is the square root of 49587?
About 222.6814.
Is 49587 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 49587?
49587 is a semiprime: 3 × 16529, the product of two primes.