The number 49581
49581 is a composite number with 12 divisors. Its prime factorisation is × 7 × 787. Divisors (12): 1, 3, 7, 9, 21, 63, 787, 2361, 5509, 7083, 16527, 49581.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49581 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49581 is composite. Its prime factorisation is
- 3
The divisors add up to 81952; without 49581 itself that is 32371, so 49581 is deficient (32371 is less than 49581). Euler's totient φ(49581) = 28296 numbers up to 49581 share no factor with it.
- 4
The digits of 49581 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49581 = 3^{2} \times 7 \times 787 \]49581 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 81952 |
| Euler totient φ(n) | 28296 |
| Square | 2458275561 |
| Cube | 121883760589941 |
| Square root | 222.667914 (= 3√5509) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9581 × |
49581 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and eighty-one |
| Binary (base 2) | 1100000110101101 |
| Octal (base 8) | 140655 |
| Hexadecimal (base 16) | C1AD |
| Base 3 | 2112000100 |
| As time | 49581 seconds = 13 h 46 min 21 s |
Is 49581 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 (49581 ÷ 3 = 16527) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (49581 ÷ 7 = 7083) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (49581 ÷ 9 = 5509) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49581 a prime number?
No. 49581 = × 7 × 787, so it is divisible by 3.
What are the factors of 49581?
1, 3, 7, 9, 21, 63, 787, 2361, 5509, 7083, 16527, 49581.
What is 49581 in binary?
1100000110101101 (hexadecimal C1AD, octal 140655).
What is the square root of 49581?
About 222.6679, exactly 3√5509.
Is 49581 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 49581?
It is a composite number with 12 divisors.