The number 51553
51553 is a composite number with 4 divisors. Its prime factorisation is 31 × 1663. Divisors (4): 1, 31, 1663, 51553.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51553: a semiprime: 31 × 1663, the product of two primes.
- 2
51553 is composite. Its prime factorisation is
- 3
The divisors add up to 53248; without 51553 itself that is 1695, so 51553 is deficient (1695 is less than 51553). Euler's totient φ(51553) = 49860 numbers up to 51553 share no factor with it.
- 4
The digits of 51553 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51553 = 31 \times 1663 \]
51553 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 53248 |
| Euler totient φ(n) | 49860 |
| Square | 2657711809 |
| Cube | 137013016889377 |
| Square root | 227.052857 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.1553 × |
51553 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand five hundred and fifty-three |
| Binary (base 2) | 1100100101100001 |
| Octal (base 8) | 144541 |
| Hexadecimal (base 16) | C961 |
| Base 3 | 2121201101 |
| As time | 51553 seconds = 14 h 19 min 13 s |
Is 51553 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 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 1) | 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 1) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51553 a prime number?
No. 51553 = 31 × 1663, so it is divisible by 31.
What are the factors of 51553?
1, 31, 1663, 51553.
What is 51553 in binary?
1100100101100001 (hexadecimal C961, octal 144541).
What is the square root of 51553?
About 227.0529.
Is 51553 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 51553?
51553 is a semiprime: 31 × 1663, the product of two primes.