The number 50404
50404 is a composite number with 6 divisors. Its prime factorisation is × 12601. Divisors (6): 1, 2, 4, 12601, 25202, 50404.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50404 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50404 is composite. Its prime factorisation is
- 3
The divisors add up to 88214; without 50404 itself that is 37810, so 50404 is deficient (37810 is less than 50404). Euler's totient φ(50404) = 25200 numbers up to 50404 share no factor with it.
- 4
The digits of 50404 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50404 = 2^{2} \times 12601 \]50404 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 88214 |
| Euler totient φ(n) | 25200 |
| Square | 2540563216 |
| Cube | 128054548339264 |
| Square root | 224.508352 (= 2√12601) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.0404 × |
50404 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand four hundred and four |
| Binary (base 2) | 1100010011100100 |
| Octal (base 8) | 142344 |
| Hexadecimal (base 16) | C4E4 |
| Base 3 | 2120010211 |
| As time | 50404 seconds = 14 h 0 min 4 s |
Is 50404 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50404 ÷ 2 = 25202) | 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 | Yes (50404 ÷ 4 = 12601) | 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 4) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50404 a prime number?
No. 50404 = × 12601, so it is divisible by 2.
What are the factors of 50404?
1, 2, 4, 12601, 25202, 50404.
What is 50404 in binary?
1100010011100100 (hexadecimal C4E4, octal 142344).
What is the square root of 50404?
About 224.5084, exactly 2√12601.
Is 50404 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 50404?
It is a composite number with 6 divisors.