The number 49061
49061 is a composite number with 4 divisors. Its prime factorisation is 71 × 691. Divisors (4): 1, 71, 691, 49061.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49061: a semiprime: 71 × 691, the product of two primes.
- 2
49061 is composite. Its prime factorisation is
- 3
The divisors add up to 49824; without 49061 itself that is 763, so 49061 is deficient (763 is less than 49061). Euler's totient φ(49061) = 48300 numbers up to 49061 share no factor with it.
- 4
The digits of 49061 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49061 = 71 \times 691 \]
49061 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 49824 |
| Euler totient φ(n) | 48300 |
| Square | 2406981721 |
| Cube | 118088930213981 |
| Square root | 221.497178 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.9061 × |
49061 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and sixty-one |
| Binary (base 2) | 1011111110100101 |
| Octal (base 8) | 137645 |
| Hexadecimal (base 16) | BFA5 |
| Base 3 | 2111022002 |
| As time | 49061 seconds = 13 h 37 min 41 s |
Is 49061 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 2) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49061 a prime number?
No. 49061 = 71 × 691, so it is divisible by 71.
What are the factors of 49061?
1, 71, 691, 49061.
What is 49061 in binary?
1011111110100101 (hexadecimal BFA5, octal 137645).
What is the square root of 49061?
About 221.4972.
Is 49061 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 49061?
49061 is a semiprime: 71 × 691, the product of two primes.