The number 51053
51053 is a composite number with 4 divisors. Its prime factorisation is 19 × 2687. Divisors (4): 1, 19, 2687, 51053.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51053: a semiprime: 19 × 2687, the product of two primes.
- 2
51053 is composite. Its prime factorisation is
- 3
The divisors add up to 53760; without 51053 itself that is 2707, so 51053 is deficient (2707 is less than 51053). Euler's totient φ(51053) = 48348 numbers up to 51053 share no factor with it.
- 4
The digits of 51053 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51053 = 19 \times 2687 \]
51053 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 53760 |
| Euler totient φ(n) | 48348 |
| Square | 2606408809 |
| Cube | 133064988925877 |
| Square root | 225.949109 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.1053 × |
51053 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and fifty-three |
| Binary (base 2) | 1100011101101101 |
| Octal (base 8) | 143555 |
| Hexadecimal (base 16) | C76D |
| Base 3 | 2121000212 |
| As time | 51053 seconds = 14 h 10 min 53 s |
Is 51053 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 | 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 5) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 51053 a prime number?
No. 51053 = 19 × 2687, so it is divisible by 19.
What are the factors of 51053?
1, 19, 2687, 51053.
What is 51053 in binary?
1100011101101101 (hexadecimal C76D, octal 143555).
What is the square root of 51053?
About 225.9491.
Is 51053 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 51053?
51053 is a semiprime: 19 × 2687, the product of two primes.