The number 50215
50215 is a composite number with 12 divisors. Its prime factorisation is 5 × × 83. Divisors (12): 1, 5, 11, 55, 83, 121, 415, 605, 913, 4565, 10043, 50215.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50215 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50215 is composite. Its prime factorisation is
- 3
The divisors add up to 67032; without 50215 itself that is 16817, so 50215 is deficient (16817 is less than 50215). Euler's totient φ(50215) = 36080 numbers up to 50215 share no factor with it.
- 4
The digits of 50215 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50215 = 5 \times 11^{2} \times 83 \]50215 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 67032 |
| Euler totient φ(n) | 36080 |
| Square | 2521546225 |
| Cube | 126619443688375 |
| Square root | 224.087037 (= 11√415) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 114 |
| Scientific notation | 5.0215 × |
50215 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand two hundred and fifteen |
| Binary (base 2) | 1100010000100111 |
| Octal (base 8) | 142047 |
| Hexadecimal (base 16) | C427 |
| Base 3 | 2112212211 |
| As time | 50215 seconds = 13 h 56 min 55 s |
Is 50215 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (50215 ÷ 5 = 10043) | 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 4) | 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 4) | 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 | Yes (50215 ÷ 11 = 4565) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50215 a prime number?
No. 50215 = 5 × × 83, so it is divisible by 5.
What are the factors of 50215?
1, 5, 11, 55, 83, 121, 415, 605, 913, 4565, 10043, 50215.
What is 50215 in binary?
1100010000100111 (hexadecimal C427, octal 142047).
What is the square root of 50215?
About 224.0870, exactly 11√415.
Is 50215 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 50215?
It is a composite number with 12 divisors.