The number 50553
50553 is a composite number with 12 divisors. Its prime factorisation is × 41 × 137. Divisors (12): 1, 3, 9, 41, 123, 137, 369, 411, 1233, 5617, 16851, 50553.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50553 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50553 is composite. Its prime factorisation is
- 3
The divisors add up to 75348; without 50553 itself that is 24795, so 50553 is deficient (24795 is less than 50553). Euler's totient φ(50553) = 32640 numbers up to 50553 share no factor with it.
- 4
The digits of 50553 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50553 = 3^{2} \times 41 \times 137 \]50553 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 75348 |
| Euler totient φ(n) | 32640 |
| Square | 2555605809 |
| Cube | 129193540462377 |
| Square root | 224.839943 (= 3√5617) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0553 × |
50553 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and fifty-three |
| Binary (base 2) | 1100010101111001 |
| Octal (base 8) | 142571 |
| Hexadecimal (base 16) | C579 |
| Base 3 | 2120100100 |
| As time | 50553 seconds = 14 h 2 min 33 s |
Is 50553 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 | Yes (50553 ÷ 3 = 16851) | 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 3) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (50553 ÷ 9 = 5617) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50553 a prime number?
No. 50553 = × 41 × 137, so it is divisible by 3.
What are the factors of 50553?
1, 3, 9, 41, 123, 137, 369, 411, 1233, 5617, 16851, 50553.
What is 50553 in binary?
1100010101111001 (hexadecimal C579, octal 142571).
What is the square root of 50553?
About 224.8399, exactly 3√5617.
Is 50553 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 50553?
It is a composite number with 12 divisors.