The number 50555
50555 is a composite number with 4 divisors. Its prime factorisation is 5 × 10111. Divisors (4): 1, 5, 10111, 50555.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50555: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 10111, the product of two primes.
- 2
50555 is composite. Its prime factorisation is
- 3
The divisors add up to 60672; without 50555 itself that is 10117, so 50555 is deficient (10117 is less than 50555). Euler's totient φ(50555) = 40440 numbers up to 50555 share no factor with it.
- 4
The digits of 50555 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50555 = 5 \times 10111 \]
50555 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 60672 |
| Euler totient φ(n) | 40440 |
| Square | 2555808025 |
| Cube | 129208874703875 |
| Square root | 224.844391 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0555 × |
50555 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and fifty-five |
| Binary (base 2) | 1100010101111011 |
| Octal (base 8) | 142573 |
| Hexadecimal (base 16) | C57B |
| Base 3 | 2120100102 |
| As time | 50555 seconds = 14 h 2 min 35 s |
Is 50555 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (50555 ÷ 5 = 10111) | 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 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50555 a prime number?
No. 50555 = 5 × 10111, so it is divisible by 5.
What are the factors of 50555?
1, 5, 10111, 50555.
What is 50555 in binary?
1100010101111011 (hexadecimal C57B, octal 142573).
What is the square root of 50555?
About 224.8444.
Is 50555 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 50555?
50555 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 10111, the product of two primes.