The number 50009
50009 is a composite number with 4 divisors. Its prime factorisation is 43 × 1163. Divisors (4): 1, 43, 1163, 50009.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50009: a semiprime: 43 × 1163, the product of two primes.
- 2
50009 is composite. Its prime factorisation is
- 3
The divisors add up to 51216; without 50009 itself that is 1207, so 50009 is deficient (1207 is less than 50009). Euler's totient φ(50009) = 48804 numbers up to 50009 share no factor with it.
- 4
The digits of 50009 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50009 = 43 \times 1163 \]
50009 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 51216 |
| Euler totient φ(n) | 48804 |
| Square | 2500900081 |
| Cube | 125067512150729 |
| Square root | 223.626921 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0009 × |
50009 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and nine |
| Binary (base 2) | 1100001101011001 |
| Octal (base 8) | 141531 |
| Hexadecimal (base 16) | C359 |
| Base 3 | 2112121012 |
| As time | 50009 seconds = 13 h 53 min 29 s |
Is 50009 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 1) | 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 9) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50009 a prime number?
No. 50009 = 43 × 1163, so it is divisible by 43.
What are the factors of 50009?
1, 43, 1163, 50009.
What is 50009 in binary?
1100001101011001 (hexadecimal C359, octal 141531).
What is the square root of 50009?
About 223.6269.
Is 50009 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 50009?
50009 is a semiprime: 43 × 1163, the product of two primes.