The number 49555
49555 is a composite number with 16 divisors. Its prime factorisation is 5 × 11 × 17 × 53. Divisors (16): 1, 5, 11, 17, 53, 55, 85, 187, 265, 583, 901, 935, 2915, 4505, 9911, 49555.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49555 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49555 is composite. Its prime factorisation is
- 3
The divisors add up to 69984; without 49555 itself that is 20429, so 49555 is deficient (20429 is less than 49555). Euler's totient φ(49555) = 33280 numbers up to 49555 share no factor with it.
- 4
The digits of 49555 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49555 = 5 \times 11 \times 17 \times 53 \]
49555 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 69984 |
| Euler totient φ(n) | 33280 |
| Square | 2455698025 |
| Cube | 121692115628875 |
| Square root | 222.609524 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 39 |
| Scientific notation | 4.9555 × |
49555 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and fifty-five |
| Binary (base 2) | 1100000110010011 |
| Octal (base 8) | 140623 |
| Hexadecimal (base 16) | C193 |
| Base 3 | 2111222101 |
| As time | 49555 seconds = 13 h 45 min 55 s |
Is 49555 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 | Yes (49555 ÷ 5 = 9911) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 | Yes (49555 ÷ 11 = 4505) | 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 49555 a prime number?
No. 49555 = 5 × 11 × 17 × 53, so it is divisible by 5.
What are the factors of 49555?
1, 5, 11, 17, 53, 55, 85, 187, 265, 583, 901, 935, 2915, 4505, 9911, 49555.
What is 49555 in binary?
1100000110010011 (hexadecimal C193, octal 140623).
What is the square root of 49555?
About 222.6095.
Is 49555 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 49555?
It is a composite number with 16 divisors.