The number 49765
49765 is a composite number with 8 divisors. Its prime factorisation is 5 × 37 × 269. Divisors (8): 1, 5, 37, 185, 269, 1345, 9953, 49765.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49765 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49765 is composite. Its prime factorisation is
- 3
The divisors add up to 61560; without 49765 itself that is 11795, so 49765 is deficient (11795 is less than 49765). Euler's totient φ(49765) = 38592 numbers up to 49765 share no factor with it.
- 4
The digits of 49765 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49765 = 5 \times 37 \times 269 \]
49765 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 61560 |
| Euler totient φ(n) | 38592 |
| Square | 2476555225 |
| Cube | 123245770772125 |
| Square root | 223.080703 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 140 |
| Scientific notation | 4.9765 × |
49765 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand seven hundred and sixty-five |
| Binary (base 2) | 1100001001100101 |
| Octal (base 8) | 141145 |
| Hexadecimal (base 16) | C265 |
| Base 3 | 2112021011 |
| As time | 49765 seconds = 13 h 49 min 25 s |
Is 49765 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (49765 ÷ 5 = 9953) | 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 2) | 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 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49765 a prime number?
No. 49765 = 5 × 37 × 269, so it is divisible by 5.
What are the factors of 49765?
1, 5, 37, 185, 269, 1345, 9953, 49765.
What is 49765 in binary?
1100001001100101 (hexadecimal C265, octal 141145).
What is the square root of 49765?
About 223.0807.
Is 49765 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 49765?
It is a composite number with 8 divisors.