The number 65050
65050 is a composite number with 12 divisors. Its prime factorisation is 2 × × 1301. Divisors (12): 1, 2, 5, 10, 25, 50, 1301, 2602, 6505, 13010, 32525, 65050.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 65050: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
65050 is composite. Its prime factorisation is
- 3
The divisors add up to 121086; without 65050 itself that is 56036, so 65050 is deficient (56036 is less than 65050). Euler's totient φ(65050) = 26000 numbers up to 65050 share no factor with it.
- 4
The digits of 65050 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 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 65050 = 2 \times 5^{2} \times 1301 \]65050 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 121086 |
| Euler totient φ(n) | 26000 |
| Square | 4231502500 |
| Cube | 275259237625000 |
| Square root | 255.049015 (= 5√2602) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 130 |
| Scientific notation | 6.505 × |
65050 in other forms
| Form | Value |
|---|---|
| In words | sixty-five thousand and fifty |
| Binary (base 2) | 1111111000011010 |
| Octal (base 8) | 177032 |
| Hexadecimal (base 16) | FE1A |
| Base 3 | 10022020021 |
| As time | 65050 seconds = 18 h 4 min 10 s |
Is 65050 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (65050 ÷ 2 = 32525) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (65050 ÷ 5 = 13010) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 2) | 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 | Yes (65050 ÷ 10 = 6505) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 65050 a prime number?
No. 65050 = 2 × × 1301, so it is divisible by 2.
What are the factors of 65050?
1, 2, 5, 10, 25, 50, 1301, 2602, 6505, 13010, 32525, 65050.
What is 65050 in binary?
1111111000011010 (hexadecimal FE1A, octal 177032).
What is the square root of 65050?
About 255.0490, exactly 5√2602.
Is 65050 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 65050?
65050 is a happy number: repeatedly adding the squares of its digits reaches 1.