The number 50402
50402 is a composite number with 16 divisors. Its prime factorisation is 2 × 11 × 29 × 79. Divisors (16): 1, 2, 11, 22, 29, 58, 79, 158, 319, 638, 869, 1738, 2291, 4582, 25201, 50402.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50402: a Harshad number: divisible by its digit sum 11.
- 2
50402 is composite. Its prime factorisation is
- 3
The divisors add up to 86400; without 50402 itself that is 35998, so 50402 is deficient (35998 is less than 50402). Euler's totient φ(50402) = 21840 numbers up to 50402 share no factor with it.
- 4
The digits of 50402 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50402 = 2 \times 11 \times 29 \times 79 \]
50402 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 86400 |
| Euler totient φ(n) | 21840 |
| Square | 2540361604 |
| Cube | 128039305564808 |
| Square root | 224.503898 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0402 × |
50402 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand four hundred and two |
| Binary (base 2) | 1100010011100010 |
| Octal (base 8) | 142342 |
| Hexadecimal (base 16) | C4E2 |
| Base 3 | 2120010202 |
| As time | 50402 seconds = 14 h 0 min 2 s |
Is 50402 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50402 ÷ 2 = 25201) | 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 2) | 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 | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (50402 ÷ 11 = 4582) | 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 50402 a prime number?
No. 50402 = 2 × 11 × 29 × 79, so it is divisible by 2.
What are the factors of 50402?
1, 2, 11, 22, 29, 58, 79, 158, 319, 638, 869, 1738, 2291, 4582, 25201, 50402.
What is 50402 in binary?
1100010011100010 (hexadecimal C4E2, octal 142342).
What is the square root of 50402?
About 224.5039.
Is 50402 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 50402?
50402 is a Harshad number: divisible by its digit sum 11.