The number 50061
50061 is a composite number with 16 divisors. Its prime factorisation is 3 × 11 × 37 × 41. Divisors (16): 1, 3, 11, 33, 37, 41, 111, 123, 407, 451, 1221, 1353, 1517, 4551, 16687, 50061.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50061 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50061 is composite. Its prime factorisation is
- 3
The divisors add up to 76608; without 50061 itself that is 26547, so 50061 is deficient (26547 is less than 50061). Euler's totient φ(50061) = 28800 numbers up to 50061 share no factor with it.
- 4
The digits of 50061 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50061 = 3 \times 11 \times 37 \times 41 \]
50061 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 76608 |
| Euler totient φ(n) | 28800 |
| Square | 2506103721 |
| Cube | 125458058376981 |
| Square root | 223.743156 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.0061 × |
50061 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and sixty-one |
| Binary (base 2) | 1100001110001101 |
| Octal (base 8) | 141615 |
| Hexadecimal (base 16) | C38D |
| Base 3 | 2112200010 |
| As time | 50061 seconds = 13 h 54 min 21 s |
Is 50061 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 | Yes (50061 ÷ 3 = 16687) | 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 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 | Yes (50061 ÷ 11 = 4551) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50061 a prime number?
No. 50061 = 3 × 11 × 37 × 41, so it is divisible by 3.
What are the factors of 50061?
1, 3, 11, 33, 37, 41, 111, 123, 407, 451, 1221, 1353, 1517, 4551, 16687, 50061.
What is 50061 in binary?
1100001110001101 (hexadecimal C38D, octal 141615).
What is the square root of 50061?
About 223.7432.
Is 50061 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 50061?
It is a composite number with 16 divisors.