The number 50414
50414 is a composite number with 16 divisors. Its prime factorisation is 2 × 7 × 13 × 277. Divisors (16): 1, 2, 7, 13, 14, 26, 91, 182, 277, 554, 1939, 3601, 3878, 7202, 25207, 50414.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50414: a Harshad number: divisible by its digit sum 14.
- 2
50414 is composite. Its prime factorisation is
- 3
The divisors add up to 93408; without 50414 itself that is 42994, so 50414 is deficient (42994 is less than 50414). Euler's totient φ(50414) = 19872 numbers up to 50414 share no factor with it.
- 4
The digits of 50414 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
\[ 50414 = 2 \times 7 \times 13 \times 277 \]
50414 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 93408 |
| Euler totient φ(n) | 19872 |
| Square | 2541571396 |
| Cube | 128130780357944 |
| Square root | 224.530622 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0414 × |
50414 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand four hundred and fourteen |
| Binary (base 2) | 1100010011101110 |
| Octal (base 8) | 142356 |
| Hexadecimal (base 16) | C4EE |
| Base 3 | 2120011012 |
| As time | 50414 seconds = 14 h 0 min 14 s |
Is 50414 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50414 ÷ 2 = 25207) | 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 2) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (50414 ÷ 7 = 7202) | 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 6) | 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 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50414 a prime number?
No. 50414 = 2 × 7 × 13 × 277, so it is divisible by 2.
What are the factors of 50414?
1, 2, 7, 13, 14, 26, 91, 182, 277, 554, 1939, 3601, 3878, 7202, 25207, 50414.
What is 50414 in binary?
1100010011101110 (hexadecimal C4EE, octal 142356).
What is the square root of 50414?
About 224.5306.
Is 50414 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 50414?
50414 is a Harshad number: divisible by its digit sum 14.