The number 50965
50965 is a composite number with 4 divisors. Its prime factorisation is 5 × 10193. Divisors (4): 1, 5, 10193, 50965.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50965: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 10193, the product of two primes.
- 2
50965 is composite. Its prime factorisation is
- 3
The divisors add up to 61164; without 50965 itself that is 10199, so 50965 is deficient (10199 is less than 50965). Euler's totient φ(50965) = 40768 numbers up to 50965 share no factor with it.
- 4
The digits of 50965 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50965 = 5 \times 10193 \]
50965 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 61164 |
| Euler totient φ(n) | 40768 |
| Square | 2597431225 |
| Cube | 132378082382125 |
| Square root | 225.754291 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 34 |
| Scientific notation | 5.0965 × |
50965 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and sixty-five |
| Binary (base 2) | 1100011100010101 |
| Octal (base 8) | 143425 |
| Hexadecimal (base 16) | C715 |
| Base 3 | 2120220121 |
| As time | 50965 seconds = 14 h 9 min 25 s |
Is 50965 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 (50965 ÷ 5 = 10193) | 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 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 5) | 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 2) | 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 50965 a prime number?
No. 50965 = 5 × 10193, so it is divisible by 5.
What are the factors of 50965?
1, 5, 10193, 50965.
What is 50965 in binary?
1100011100010101 (hexadecimal C715, octal 143425).
What is the square root of 50965?
About 225.7543.
Is 50965 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 50965?
50965 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 10193, the product of two primes.