The number 49291
49291 is a composite number with 4 divisors. Its prime factorisation is 11 × 4481. Divisors (4): 1, 11, 4481, 49291.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49291: a semiprime: 11 × 4481, the product of two primes.
- 2
49291 is composite. Its prime factorisation is
- 3
The divisors add up to 53784; without 49291 itself that is 4493, so 49291 is deficient (4493 is less than 49291). Euler's totient φ(49291) = 44800 numbers up to 49291 share no factor with it.
- 4
The digits of 49291 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
\[ 49291 = 11 \times 4481 \]
49291 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 53784 |
| Euler totient φ(n) | 44800 |
| Square | 2429602681 |
| Cube | 119757545749171 |
| Square root | 222.015765 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9291 × |
49291 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand two hundred and ninety-one |
| Binary (base 2) | 1100000010001011 |
| Octal (base 8) | 140213 |
| Hexadecimal (base 16) | C08B |
| Base 3 | 2111121121 |
| As time | 49291 seconds = 13 h 41 min 31 s |
Is 49291 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 3) | 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 1) | 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 3) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (49291 ÷ 11 = 4481) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49291 a prime number?
No. 49291 = 11 × 4481, so it is divisible by 11.
What are the factors of 49291?
1, 11, 4481, 49291.
What is 49291 in binary?
1100000010001011 (hexadecimal C08B, octal 140213).
What is the square root of 49291?
About 222.0158.
Is 49291 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49291?
49291 is a semiprime: 11 × 4481, the product of two primes.