The number 49055
49055 is a composite number with 4 divisors. Its prime factorisation is 5 × 9811. Divisors (4): 1, 5, 9811, 49055.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49055: a semiprime: 5 × 9811, the product of two primes.
- 2
49055 is composite. Its prime factorisation is
- 3
The divisors add up to 58872; without 49055 itself that is 9817, so 49055 is deficient (9817 is less than 49055). Euler's totient φ(49055) = 39240 numbers up to 49055 share no factor with it.
- 4
The digits of 49055 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49055 = 5 \times 9811 \]
49055 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 58872 |
| Euler totient φ(n) | 39240 |
| Square | 2406393025 |
| Cube | 118045609841375 |
| Square root | 221.483634 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9055 × |
49055 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and fifty-five |
| Binary (base 2) | 1011111110011111 |
| Octal (base 8) | 137637 |
| Hexadecimal (base 16) | BF9F |
| Base 3 | 2111021212 |
| As time | 49055 seconds = 13 h 37 min 35 s |
Is 49055 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (49055 ÷ 5 = 9811) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49055 a prime number?
No. 49055 = 5 × 9811, so it is divisible by 5.
What are the factors of 49055?
1, 5, 9811, 49055.
What is 49055 in binary?
1011111110011111 (hexadecimal BF9F, octal 137637).
What is the square root of 49055?
About 221.4836.
Is 49055 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 49055?
49055 is a semiprime: 5 × 9811, the product of two primes.