The number 50065
50065 is a composite number with 16 divisors. Its prime factorisation is 5 × 17 × 19 × 31. Divisors (16): 1, 5, 17, 19, 31, 85, 95, 155, 323, 527, 589, 1615, 2635, 2945, 10013, 50065.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50065: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
50065 is composite. Its prime factorisation is
- 3
The divisors add up to 69120; without 50065 itself that is 19055, so 50065 is deficient (19055 is less than 50065). Euler's totient φ(50065) = 34560 numbers up to 50065 share no factor with it.
- 4
The digits of 50065 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50065 = 5 \times 17 \times 19 \times 31 \]
50065 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 69120 |
| Euler totient φ(n) | 34560 |
| Square | 2506504225 |
| Cube | 125488134024625 |
| Square root | 223.752095 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0065 × |
50065 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and sixty-five |
| Binary (base 2) | 1100001110010001 |
| Octal (base 8) | 141621 |
| Hexadecimal (base 16) | C391 |
| Base 3 | 2112200021 |
| As time | 50065 seconds = 13 h 54 min 25 s |
Is 50065 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (50065 ÷ 5 = 10013) | 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 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 1) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50065 a prime number?
No. 50065 = 5 × 17 × 19 × 31, so it is divisible by 5.
What are the factors of 50065?
1, 5, 17, 19, 31, 85, 95, 155, 323, 527, 589, 1615, 2635, 2945, 10013, 50065.
What is 50065 in binary?
1100001110010001 (hexadecimal C391, octal 141621).
What is the square root of 50065?
About 223.7521.
Is 50065 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 50065?
50065 is a happy number: repeatedly adding the squares of its digits reaches 1.