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