The number 50395
50395 is a composite number with 4 divisors. Its prime factorisation is 5 × 10079. Divisors (4): 1, 5, 10079, 50395.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50395: a semiprime: 5 × 10079, the product of two primes.
- 2
50395 is composite. Its prime factorisation is
- 3
The divisors add up to 60480; without 50395 itself that is 10085, so 50395 is deficient (10085 is less than 50395). Euler's totient φ(50395) = 40312 numbers up to 50395 share no factor with it.
- 4
The digits of 50395 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50395 = 5 \times 10079 \]
50395 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 60480 |
| Euler totient φ(n) | 40312 |
| Square | 2539656025 |
| Cube | 127985965379875 |
| Square root | 224.488307 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 70 |
| Scientific notation | 5.0395 × |
50395 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and ninety-five |
| Binary (base 2) | 1100010011011011 |
| Octal (base 8) | 142333 |
| Hexadecimal (base 16) | C4DB |
| Base 3 | 2120010111 |
| As time | 50395 seconds = 13 h 59 min 55 s |
Is 50395 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 (50395 ÷ 5 = 10079) | 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 2) | 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 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 | No (remainder 4) | 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 50395 a prime number?
No. 50395 = 5 × 10079, so it is divisible by 5.
What are the factors of 50395?
1, 5, 10079, 50395.
What is 50395 in binary?
1100010011011011 (hexadecimal C4DB, octal 142333).
What is the square root of 50395?
About 224.4883.
Is 50395 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 50395?
50395 is a semiprime: 5 × 10079, the product of two primes.