The number 50315
50315 is a composite number with 8 divisors. Its prime factorisation is 5 × 29 × 347. Divisors (8): 1, 5, 29, 145, 347, 1735, 10063, 50315.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50315 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50315 is composite. Its prime factorisation is
- 3
The divisors add up to 62640; without 50315 itself that is 12325, so 50315 is deficient (12325 is less than 50315). Euler's totient φ(50315) = 38752 numbers up to 50315 share no factor with it.
- 4
The digits of 50315 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50315 = 5 \times 29 \times 347 \]
50315 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 62640 |
| Euler totient φ(n) | 38752 |
| Square | 2531599225 |
| Cube | 127377415005875 |
| Square root | 224.310053 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 114 |
| Scientific notation | 5.0315 × |
50315 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and fifteen |
| Binary (base 2) | 1100010010001011 |
| Octal (base 8) | 142213 |
| Hexadecimal (base 16) | C48B |
| Base 3 | 2120000112 |
| As time | 50315 seconds = 13 h 58 min 35 s |
Is 50315 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 (50315 ÷ 5 = 10063) | 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 6) | 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 5) | 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 50315 a prime number?
No. 50315 = 5 × 29 × 347, so it is divisible by 5.
What are the factors of 50315?
1, 5, 29, 145, 347, 1735, 10063, 50315.
What is 50315 in binary?
1100010010001011 (hexadecimal C48B, octal 142213).
What is the square root of 50315?
About 224.3101.
Is 50315 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 50315?
It is a composite number with 8 divisors.