The number 50585
50585 is a composite number with 8 divisors. Its prime factorisation is 5 × 67 × 151. Divisors (8): 1, 5, 67, 151, 335, 755, 10117, 50585.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50585: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
50585 is composite. Its prime factorisation is
- 3
The divisors add up to 62016; without 50585 itself that is 11431, so 50585 is deficient (11431 is less than 50585). Euler's totient φ(50585) = 39600 numbers up to 50585 share no factor with it.
- 4
The digits of 50585 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50585 = 5 \times 67 \times 151 \]
50585 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 62016 |
| Euler totient φ(n) | 39600 |
| Square | 2558842225 |
| Cube | 129439033951625 |
| Square root | 224.911094 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 57 |
| Scientific notation | 5.0585 × |
50585 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and eighty-five |
| Binary (base 2) | 1100010110011001 |
| Octal (base 8) | 142631 |
| Hexadecimal (base 16) | C599 |
| Base 3 | 2120101112 |
| As time | 50585 seconds = 14 h 3 min 5 s |
Is 50585 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 | Yes (50585 ÷ 5 = 10117) | 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 3) | 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 5) | 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 7) | 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 50585 a prime number?
No. 50585 = 5 × 67 × 151, so it is divisible by 5.
What are the factors of 50585?
1, 5, 67, 151, 335, 755, 10117, 50585.
What is 50585 in binary?
1100010110011001 (hexadecimal C599, octal 142631).
What is the square root of 50585?
About 224.9111.
Is 50585 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 50585?
50585 is a happy number: repeatedly adding the squares of its digits reaches 1.