The number 49767
49767 is a composite number with 8 divisors. Its prime factorisation is 3 × 53 × 313. Divisors (8): 1, 3, 53, 159, 313, 939, 16589, 49767.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49767 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49767 is composite. Its prime factorisation is
- 3
The divisors add up to 67824; without 49767 itself that is 18057, so 49767 is deficient (18057 is less than 49767). Euler's totient φ(49767) = 32448 numbers up to 49767 share no factor with it.
- 4
The digits of 49767 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 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49767 = 3 \times 53 \times 313 \]
49767 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 67824 |
| Euler totient φ(n) | 32448 |
| Square | 2476754289 |
| Cube | 123260630700663 |
| Square root | 223.085186 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.9767 × |
49767 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand seven hundred and sixty-seven |
| Binary (base 2) | 1100001001100111 |
| Octal (base 8) | 141147 |
| Hexadecimal (base 16) | C267 |
| Base 3 | 2112021020 |
| As time | 49767 seconds = 13 h 49 min 27 s |
Is 49767 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 (49767 ÷ 3 = 16589) | 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 4) | 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 7) | 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 3) | 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 49767 a prime number?
No. 49767 = 3 × 53 × 313, so it is divisible by 3.
What are the factors of 49767?
1, 3, 53, 159, 313, 939, 16589, 49767.
What is 49767 in binary?
1100001001100111 (hexadecimal C267, octal 141147).
What is the square root of 49767?
About 223.0852.
Is 49767 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 49767?
It is a composite number with 8 divisors.