The number 50409
50409 is a composite number with 8 divisors. Its prime factorisation is × 1867. Divisors (8): 1, 3, 9, 27, 1867, 5601, 16803, 50409.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50409 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50409 is composite. Its prime factorisation is
- 3
The divisors add up to 74720; without 50409 itself that is 24311, so 50409 is deficient (24311 is less than 50409). Euler's totient φ(50409) = 33588 numbers up to 50409 share no factor with it.
- 4
The digits of 50409 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50409 = 3^{3} \times 1867 \]50409 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 74720 |
| Euler totient φ(n) | 33588 |
| Square | 2541067281 |
| Cube | 128092660567929 |
| Square root | 224.519487 (= 3√5601) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0409 × |
50409 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand four hundred and nine |
| Binary (base 2) | 1100010011101001 |
| Octal (base 8) | 142351 |
| Hexadecimal (base 16) | C4E9 |
| Base 3 | 2120011000 |
| As time | 50409 seconds = 14 h 0 min 9 s |
Is 50409 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 (50409 ÷ 3 = 16803) | 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 3) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (50409 ÷ 9 = 5601) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50409 a prime number?
No. 50409 = × 1867, so it is divisible by 3.
What are the factors of 50409?
1, 3, 9, 27, 1867, 5601, 16803, 50409.
What is 50409 in binary?
1100010011101001 (hexadecimal C4E9, octal 142351).
What is the square root of 50409?
About 224.5195, exactly 3√5601.
Is 50409 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 50409?
It is a composite number with 8 divisors.