The number 50501
50501 is a composite number with 4 divisors. Its prime factorisation is 11 × 4591. Divisors (4): 1, 11, 4591, 50501.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50501: a Harshad number: divisible by its digit sum 11; a semiprime: 11 × 4591, the product of two primes.
- 2
50501 is composite. Its prime factorisation is
- 3
The divisors add up to 55104; without 50501 itself that is 4603, so 50501 is deficient (4603 is less than 50501). Euler's totient φ(50501) = 45900 numbers up to 50501 share no factor with it.
- 4
The digits of 50501 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 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50501 = 11 \times 4591 \]
50501 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 55104 |
| Euler totient φ(n) | 45900 |
| Square | 2550351001 |
| Cube | 128795275901501 |
| Square root | 224.724276 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.0501 × |
50501 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and one |
| Binary (base 2) | 1100010101000101 |
| Octal (base 8) | 142505 |
| Hexadecimal (base 16) | C545 |
| Base 3 | 2120021102 |
| As time | 50501 seconds = 14 h 1 min 41 s |
Is 50501 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 2) | 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 (50501 ÷ 11 = 4591) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50501 a prime number?
No. 50501 = 11 × 4591, so it is divisible by 11.
What are the factors of 50501?
1, 11, 4591, 50501.
What is 50501 in binary?
1100010101000101 (hexadecimal C545, octal 142505).
What is the square root of 50501?
About 224.7243.
Is 50501 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 50501?
50501 is a Harshad number: divisible by its digit sum 11; a semiprime: 11 × 4591, the product of two primes.