The number 50509
50509 is a composite number with 4 divisors. Its prime factorisation is 53 × 953. Divisors (4): 1, 53, 953, 50509.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50509: a semiprime: 53 × 953, the product of two primes.
- 2
50509 is composite. Its prime factorisation is
- 3
The divisors add up to 51516; without 50509 itself that is 1007, so 50509 is deficient (1007 is less than 50509). Euler's totient φ(50509) = 49504 numbers up to 50509 share no factor with it.
- 4
The digits of 50509 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 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50509 = 53 \times 953 \]
50509 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 51516 |
| Euler totient φ(n) | 49504 |
| Square | 2551159081 |
| Cube | 128856494022229 |
| Square root | 224.742074 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.0509 × |
50509 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and nine |
| Binary (base 2) | 1100010101001101 |
| Octal (base 8) | 142515 |
| Hexadecimal (base 16) | C54D |
| Base 3 | 2120021201 |
| As time | 50509 seconds = 14 h 1 min 49 s |
Is 50509 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 5) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50509 a prime number?
No. 50509 = 53 × 953, so it is divisible by 53.
What are the factors of 50509?
1, 53, 953, 50509.
What is 50509 in binary?
1100010101001101 (hexadecimal C54D, octal 142515).
What is the square root of 50509?
About 224.7421.
Is 50509 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 50509?
50509 is a semiprime: 53 × 953, the product of two primes.