The number 50161
50161 is a composite number with 4 divisors. Its prime factorisation is 103 × 487. Divisors (4): 1, 103, 487, 50161.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50161: a semiprime: 103 × 487, the product of two primes.
- 2
50161 is composite. Its prime factorisation is
- 3
The divisors add up to 50752; without 50161 itself that is 591, so 50161 is deficient (591 is less than 50161). Euler's totient φ(50161) = 49572 numbers up to 50161 share no factor with it.
- 4
The digits of 50161 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50161 = 103 \times 487 \]
50161 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50752 |
| Euler totient φ(n) | 49572 |
| Square | 2516125921 |
| Cube | 126211392323281 |
| Square root | 223.966515 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0161 × |
50161 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand one hundred and sixty-one |
| Binary (base 2) | 1100001111110001 |
| Octal (base 8) | 141761 |
| Hexadecimal (base 16) | C3F1 |
| Base 3 | 2112210211 |
| As time | 50161 seconds = 13 h 56 min 1 s |
Is 50161 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 6) | 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 4) | 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 1) | 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 50161 a prime number?
No. 50161 = 103 × 487, so it is divisible by 103.
What are the factors of 50161?
1, 103, 487, 50161.
What is 50161 in binary?
1100001111110001 (hexadecimal C3F1, octal 141761).
What is the square root of 50161?
About 223.9665.
Is 50161 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 50161?
50161 is a semiprime: 103 × 487, the product of two primes.