The number 49553
49553 is a composite number with 4 divisors. Its prime factorisation is 7 × 7079. Divisors (4): 1, 7, 7079, 49553.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49553: a semiprime: 7 × 7079, the product of two primes.
- 2
49553 is composite. Its prime factorisation is
- 3
The divisors add up to 56640; without 49553 itself that is 7087, so 49553 is deficient (7087 is less than 49553). Euler's totient φ(49553) = 42468 numbers up to 49553 share no factor with it.
- 4
The digits of 49553 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49553 = 7 \times 7079 \]
49553 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 56640 |
| Euler totient φ(n) | 42468 |
| Square | 2455499809 |
| Cube | 121677382035377 |
| Square root | 222.605031 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 39 |
| Scientific notation | 4.9553 × |
49553 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and fifty-three |
| Binary (base 2) | 1100000110010001 |
| Octal (base 8) | 140621 |
| Hexadecimal (base 16) | C191 |
| Base 3 | 2111222022 |
| As time | 49553 seconds = 13 h 45 min 53 s |
Is 49553 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 3) | 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 | Yes (49553 ÷ 7 = 7079) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 49553 a prime number?
No. 49553 = 7 × 7079, so it is divisible by 7.
What are the factors of 49553?
1, 7, 7079, 49553.
What is 49553 in binary?
1100000110010001 (hexadecimal C191, octal 140621).
What is the square root of 49553?
About 222.6050.
Is 49553 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 49553?
49553 is a semiprime: 7 × 7079, the product of two primes.