The number 49282
49282 is a composite number with 8 divisors. Its prime factorisation is 2 × 41 × 601. Divisors (8): 1, 2, 41, 82, 601, 1202, 24641, 49282.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49282 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49282 is composite. Its prime factorisation is
- 3
The divisors add up to 75852; without 49282 itself that is 26570, so 49282 is deficient (26570 is less than 49282). Euler's totient φ(49282) = 24000 numbers up to 49282 share no factor with it.
- 4
The digits of 49282 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49282 = 2 \times 41 \times 601 \]
49282 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 75852 |
| Euler totient φ(n) | 24000 |
| Square | 2428715524 |
| Cube | 119691958453768 |
| Square root | 221.995495 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9282 × |
49282 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand two hundred and eighty-two |
| Binary (base 2) | 1100000010000010 |
| Octal (base 8) | 140202 |
| Hexadecimal (base 16) | C082 |
| Base 3 | 2111121021 |
| As time | 49282 seconds = 13 h 41 min 22 s |
Is 49282 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49282 ÷ 2 = 24641) | 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 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 2) | 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 49282 a prime number?
No. 49282 = 2 × 41 × 601, so it is divisible by 2.
What are the factors of 49282?
1, 2, 41, 82, 601, 1202, 24641, 49282.
What is 49282 in binary?
1100000010000010 (hexadecimal C082, octal 140202).
What is the square root of 49282?
About 221.9955.
Is 49282 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49282?
It is a composite number with 8 divisors.