The number 49762
49762 is a composite number with 8 divisors. Its prime factorisation is 2 × 139 × 179. Divisors (8): 1, 2, 139, 179, 278, 358, 24881, 49762.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49762 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49762 is composite. Its prime factorisation is
- 3
The divisors add up to 75600; without 49762 itself that is 25838, so 49762 is deficient (25838 is less than 49762). Euler's totient φ(49762) = 24564 numbers up to 49762 share no factor with it.
- 4
The digits of 49762 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49762 = 2 \times 139 \times 179 \]
49762 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 75600 |
| Euler totient φ(n) | 24564 |
| Square | 2476256644 |
| Cube | 123223483118728 |
| Square root | 223.073979 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 140 |
| Scientific notation | 4.9762 × |
49762 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand seven hundred and sixty-two |
| Binary (base 2) | 1100001001100010 |
| Octal (base 8) | 141142 |
| Hexadecimal (base 16) | C262 |
| Base 3 | 2112021001 |
| As time | 49762 seconds = 13 h 49 min 22 s |
Is 49762 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49762 ÷ 2 = 24881) | 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 2) | 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 4) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49762 a prime number?
No. 49762 = 2 × 139 × 179, so it is divisible by 2.
What are the factors of 49762?
1, 2, 139, 179, 278, 358, 24881, 49762.
What is 49762 in binary?
1100001001100010 (hexadecimal C262, octal 141142).
What is the square root of 49762?
About 223.0740.
Is 49762 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 49762?
It is a composite number with 8 divisors.