The number 50975
50975 is a composite number with 6 divisors. Its prime factorisation is Ć 2039. Divisors (6): 1, 5, 25, 2039, 10195, 50975.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50975 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50975 is composite. Its prime factorisation is
- 3
The divisors add up to 63240; without 50975 itself that is 12265, so 50975 is deficient (12265 is less than 50975). Euler's totient Ļ(50975) = 40760 numbers up to 50975 share no factor with it.
- 4
The digits of 50975 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50975 = 5^{2} \times 2039 \]50975 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 63240 |
| Euler totient Ļ(n) | 40760 |
| Square | 2598450625 |
| Cube | 132456020609375 |
| Square root | 225.776438 (= 5ā2039) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0975 Ć |
50975 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and seventy-five |
| Binary (base 2) | 1100011100011111 |
| Octal (base 8) | 143437 |
| Hexadecimal (base 16) | C71F |
| Base 3 | 2120220222 |
| As time | 50975 seconds = 14 h 9 min 35 s |
Is 50975 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (50975 Ć· 5 = 10195) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50975 a prime number?
No. 50975 = Ć 2039, so it is divisible by 5.
What are the factors of 50975?
1, 5, 25, 2039, 10195, 50975.
What is 50975 in binary?
1100011100011111 (hexadecimal C71F, octal 143437).
What is the square root of 50975?
About 225.7764, exactly 5ā2039.
Is 50975 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 50975?
It is a composite number with 6 divisors.