The number 50401
50401 is a composite number with 4 divisors. Its prime factorisation is 13 × 3877. Divisors (4): 1, 13, 3877, 50401.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50401: a semiprime: 13 × 3877, the product of two primes.
- 2
50401 is composite. Its prime factorisation is
- 3
The divisors add up to 54292; without 50401 itself that is 3891, so 50401 is deficient (3891 is less than 50401). Euler's totient φ(50401) = 46512 numbers up to 50401 share no factor with it.
- 4
The digits of 50401 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50401 = 13 \times 3877 \]
50401 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 54292 |
| Euler totient φ(n) | 46512 |
| Square | 2540260801 |
| Cube | 128031684631201 |
| Square root | 224.501670 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 70 |
| Scientific notation | 5.0401 × |
50401 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand four hundred and one |
| Binary (base 2) | 1100010011100001 |
| Octal (base 8) | 142341 |
| Hexadecimal (base 16) | C4E1 |
| Base 3 | 2120010201 |
| As time | 50401 seconds = 14 h 0 min 1 s |
Is 50401 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 1) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50401 a prime number?
No. 50401 = 13 × 3877, so it is divisible by 13.
What are the factors of 50401?
1, 13, 3877, 50401.
What is 50401 in binary?
1100010011100001 (hexadecimal C4E1, octal 142341).
What is the square root of 50401?
About 224.5017.
Is 50401 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 50401?
50401 is a semiprime: 13 × 3877, the product of two primes.