The number 50515
50515 is a composite number with 4 divisors. Its prime factorisation is 5 × 10103. Divisors (4): 1, 5, 10103, 50515.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50515: a semiprime: 5 × 10103, the product of two primes.
- 2
50515 is composite. Its prime factorisation is
- 3
The divisors add up to 60624; without 50515 itself that is 10109, so 50515 is deficient (10109 is less than 50515). Euler's totient φ(50515) = 40408 numbers up to 50515 share no factor with it.
- 4
The digits of 50515 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 233 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50515 = 5 \times 10103 \]
50515 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 60624 |
| Euler totient φ(n) | 40408 |
| Square | 2551765225 |
| Cube | 128902420340875 |
| Square root | 224.755423 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 233 |
| Scientific notation | 5.0515 × |
50515 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and fifteen |
| Binary (base 2) | 1100010101010011 |
| Octal (base 8) | 142523 |
| Hexadecimal (base 16) | C553 |
| Base 3 | 2120021221 |
| As time | 50515 seconds = 14 h 1 min 55 s |
Is 50515 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 (50515 ÷ 5 = 10103) | 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 3) | 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 3) | 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 3) | 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 50515 a prime number?
No. 50515 = 5 × 10103, so it is divisible by 5.
What are the factors of 50515?
1, 5, 10103, 50515.
What is 50515 in binary?
1100010101010011 (hexadecimal C553, octal 142523).
What is the square root of 50515?
About 224.7554.
Is 50515 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 50515?
50515 is a semiprime: 5 × 10103, the product of two primes.