The number 50055
50055 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 47 × 71. Divisors (16): 1, 3, 5, 15, 47, 71, 141, 213, 235, 355, 705, 1065, 3337, 10011, 16685, 50055.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50055: a Harshad number: divisible by its digit sum 15.
- 2
50055 is composite. Its prime factorisation is
- 3
The divisors add up to 82944; without 50055 itself that is 32889, so 50055 is deficient (32889 is less than 50055). Euler's totient φ(50055) = 25760 numbers up to 50055 share no factor with it.
- 4
The digits of 50055 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 88 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50055 = 3 \times 5 \times 47 \times 71 \]
50055 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 82944 |
| Euler totient φ(n) | 25760 |
| Square | 2505503025 |
| Cube | 125412953916375 |
| Square root | 223.729748 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 88 |
| Scientific notation | 5.0055 × |
50055 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and fifty-five |
| Binary (base 2) | 1100001110000111 |
| Octal (base 8) | 141607 |
| Hexadecimal (base 16) | C387 |
| Base 3 | 2112122220 |
| As time | 50055 seconds = 13 h 54 min 15 s |
Is 50055 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 (50055 ÷ 3 = 16685) | 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 (50055 ÷ 5 = 10011) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50055 a prime number?
No. 50055 = 3 × 5 × 47 × 71, so it is divisible by 3.
What are the factors of 50055?
1, 3, 5, 15, 47, 71, 141, 213, 235, 355, 705, 1065, 3337, 10011, 16685, 50055.
What is 50055 in binary?
1100001110000111 (hexadecimal C387, octal 141607).
What is the square root of 50055?
About 223.7297.
Is 50055 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 50055?
50055 is a Harshad number: divisible by its digit sum 15.