The number 49761
49761 is a composite number with 16 divisors. Its prime factorisation is × 19 × 97. Divisors (16): 1, 3, 9, 19, 27, 57, 97, 171, 291, 513, 873, 1843, 2619, 5529, 16587, 49761.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49761: a Harshad number: divisible by its digit sum 27.
- 2
49761 is composite. Its prime factorisation is
- 3
The divisors add up to 78400; without 49761 itself that is 28639, so 49761 is deficient (28639 is less than 49761). Euler's totient φ(49761) = 31104 numbers up to 49761 share no factor with it.
- 4
The digits of 49761 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 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49761 = 3^{3} \times 19 \times 97 \]49761 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 78400 |
| Euler totient φ(n) | 31104 |
| Square | 2476157121 |
| Cube | 123216054498081 |
| Square root | 223.071737 (= 3√5529) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.9761 × |
49761 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand seven hundred and sixty-one |
| Binary (base 2) | 1100001001100001 |
| Octal (base 8) | 141141 |
| Hexadecimal (base 16) | C261 |
| Base 3 | 2112021000 |
| As time | 49761 seconds = 13 h 49 min 21 s |
Is 49761 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 (49761 ÷ 3 = 16587) | 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 | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (49761 ÷ 9 = 5529) | 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 8) | 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 49761 a prime number?
No. 49761 = × 19 × 97, so it is divisible by 3.
What are the factors of 49761?
1, 3, 9, 19, 27, 57, 97, 171, 291, 513, 873, 1843, 2619, 5529, 16587, 49761.
What is 49761 in binary?
1100001001100001 (hexadecimal C261, octal 141141).
What is the square root of 49761?
About 223.0717, exactly 3√5529.
Is 49761 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 49761?
49761 is a Harshad number: divisible by its digit sum 27.