The number 50601
50601 is a composite number with 8 divisors. Its prime factorisation is 3 × 101 × 167. Divisors (8): 1, 3, 101, 167, 303, 501, 16867, 50601.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50601 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50601 is composite. Its prime factorisation is
- 3
The divisors add up to 68544; without 50601 itself that is 17943, so 50601 is deficient (17943 is less than 50601). Euler's totient φ(50601) = 33200 numbers up to 50601 share no factor with it.
- 4
The digits of 50601 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 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50601 = 3 \times 101 \times 167 \]
50601 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 68544 |
| Euler totient φ(n) | 33200 |
| Square | 2560461201 |
| Cube | 129561897231801 |
| Square root | 224.946660 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 57 |
| Scientific notation | 5.0601 × |
50601 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand six hundred and one |
| Binary (base 2) | 1100010110101001 |
| Octal (base 8) | 142651 |
| Hexadecimal (base 16) | C5A9 |
| Base 3 | 2120102010 |
| As time | 50601 seconds = 14 h 3 min 21 s |
Is 50601 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 (50601 ÷ 3 = 16867) | 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 5) | 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 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 | No (remainder 1) | 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 50601 a prime number?
No. 50601 = 3 × 101 × 167, so it is divisible by 3.
What are the factors of 50601?
1, 3, 101, 167, 303, 501, 16867, 50601.
What is 50601 in binary?
1100010110101001 (hexadecimal C5A9, octal 142651).
What is the square root of 50601?
About 224.9467.
Is 50601 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 50601?
It is a composite number with 8 divisors.