The number 50635
50635 is a composite number with 16 divisors. Its prime factorisation is 5 × 13 × 19 × 41. Divisors (16): 1, 5, 13, 19, 41, 65, 95, 205, 247, 533, 779, 1235, 2665, 3895, 10127, 50635.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50635: a Harshad number: divisible by its digit sum 19.
- 2
50635 is composite. Its prime factorisation is
- 3
The divisors add up to 70560; without 50635 itself that is 19925, so 50635 is deficient (19925 is less than 50635). Euler's totient φ(50635) = 34560 numbers up to 50635 share no factor with it.
- 4
The digits of 50635 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50635 = 5 \times 13 \times 19 \times 41 \]
50635 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 70560 |
| Euler totient φ(n) | 34560 |
| Square | 2563903225 |
| Cube | 129823239797875 |
| Square root | 225.022221 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0635 × |
50635 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand six hundred and thirty-five |
| Binary (base 2) | 1100010111001011 |
| Octal (base 8) | 142713 |
| Hexadecimal (base 16) | C5CB |
| Base 3 | 2120110101 |
| As time | 50635 seconds = 14 h 3 min 55 s |
Is 50635 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 (50635 ÷ 5 = 10127) | 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 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 1) | 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 2) | 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 50635 a prime number?
No. 50635 = 5 × 13 × 19 × 41, so it is divisible by 5.
What are the factors of 50635?
1, 5, 13, 19, 41, 65, 95, 205, 247, 533, 779, 1235, 2665, 3895, 10127, 50635.
What is 50635 in binary?
1100010111001011 (hexadecimal C5CB, octal 142713).
What is the square root of 50635?
About 225.0222.
Is 50635 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 50635?
50635 is a Harshad number: divisible by its digit sum 19.