The number 50295
50295 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 7 × 479. Divisors (16): 1, 3, 5, 7, 15, 21, 35, 105, 479, 1437, 2395, 3353, 7185, 10059, 16765, 50295.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50295: a Harshad number: divisible by its digit sum 21.
- 2
50295 is composite. Its prime factorisation is
- 3
The divisors add up to 92160; without 50295 itself that is 41865, so 50295 is deficient (41865 is less than 50295). Euler's totient φ(50295) = 22944 numbers up to 50295 share no factor with it.
- 4
The digits of 50295 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50295 = 3 \times 5 \times 7 \times 479 \]
50295 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 92160 |
| Euler totient φ(n) | 22944 |
| Square | 2529587025 |
| Cube | 127225579422375 |
| Square root | 224.265468 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 39 |
| Scientific notation | 5.0295 × |
50295 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand two hundred and ninety-five |
| Binary (base 2) | 1100010001110111 |
| Octal (base 8) | 142167 |
| Hexadecimal (base 16) | C477 |
| Base 3 | 2112222210 |
| As time | 50295 seconds = 13 h 58 min 15 s |
Is 50295 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 | Yes (50295 ÷ 3 = 16765) | 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 (50295 ÷ 5 = 10059) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (50295 ÷ 7 = 7185) | 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 3) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50295 a prime number?
No. 50295 = 3 × 5 × 7 × 479, so it is divisible by 3.
What are the factors of 50295?
1, 3, 5, 7, 15, 21, 35, 105, 479, 1437, 2395, 3353, 7185, 10059, 16765, 50295.
What is 50295 in binary?
1100010001110111 (hexadecimal C477, octal 142167).
What is the square root of 50295?
About 224.2655.
Is 50295 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 50295?
50295 is a Harshad number: divisible by its digit sum 21.