The number 50915
50915 is a composite number with 8 divisors. Its prime factorisation is 5 × 17 × 599. Divisors (8): 1, 5, 17, 85, 599, 2995, 10183, 50915.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50915 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50915 is composite. Its prime factorisation is
- 3
The divisors add up to 64800; without 50915 itself that is 13885, so 50915 is deficient (13885 is less than 50915). Euler's totient φ(50915) = 38272 numbers up to 50915 share no factor with it.
- 4
The digits of 50915 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50915 = 5 \times 17 \times 599 \]
50915 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 64800 |
| Euler totient φ(n) | 38272 |
| Square | 2592337225 |
| Cube | 131988849810875 |
| Square root | 225.643524 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0915 × |
50915 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and fifteen |
| Binary (base 2) | 1100011011100011 |
| Octal (base 8) | 143343 |
| Hexadecimal (base 16) | C6E3 |
| Base 3 | 2120211202 |
| As time | 50915 seconds = 14 h 8 min 35 s |
Is 50915 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 (50915 ÷ 5 = 10183) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 7) | 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 50915 a prime number?
No. 50915 = 5 × 17 × 599, so it is divisible by 5.
What are the factors of 50915?
1, 5, 17, 85, 599, 2995, 10183, 50915.
What is 50915 in binary?
1100011011100011 (hexadecimal C6E3, octal 143343).
What is the square root of 50915?
About 225.6435.
Is 50915 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 50915?
It is a composite number with 8 divisors.