The number 49281
49281 is a composite number with 4 divisors. Its prime factorisation is 3 × 16427. Divisors (4): 1, 3, 16427, 49281.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49281: a semiprime: 3 × 16427, the product of two primes.
- 2
49281 is composite. Its prime factorisation is
- 3
The divisors add up to 65712; without 49281 itself that is 16431, so 49281 is deficient (16431 is less than 49281). Euler's totient φ(49281) = 32852 numbers up to 49281 share no factor with it.
- 4
The digits of 49281 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49281 = 3 \times 16427 \]
49281 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 65712 |
| Euler totient φ(n) | 32852 |
| Square | 2428616961 |
| Cube | 119684672455041 |
| Square root | 221.993243 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9281 × |
49281 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand two hundred and eighty-one |
| Binary (base 2) | 1100000010000001 |
| Octal (base 8) | 140201 |
| Hexadecimal (base 16) | C081 |
| Base 3 | 2111121020 |
| As time | 49281 seconds = 13 h 41 min 21 s |
Is 49281 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 (49281 ÷ 3 = 16427) | 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 1) | 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 | No (remainder 6) | 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 1) | 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 49281 a prime number?
No. 49281 = 3 × 16427, so it is divisible by 3.
What are the factors of 49281?
1, 3, 16427, 49281.
What is 49281 in binary?
1100000010000001 (hexadecimal C081, octal 140201).
What is the square root of 49281?
About 221.9932.
Is 49281 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 49281?
49281 is a semiprime: 3 × 16427, the product of two primes.