The number 50301
50301 is a composite number with 16 divisors. Its prime factorisation is × 23. Divisors (16): 1, 3, 9, 23, 27, 69, 81, 207, 243, 621, 729, 1863, 2187, 5589, 16767, 50301.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50301: a Harshad number: divisible by its digit sum 9.
- 2
50301 is composite. Its prime factorisation is
- 3
The divisors add up to 78720; without 50301 itself that is 28419, so 50301 is deficient (28419 is less than 50301). Euler's totient φ(50301) = 32076 numbers up to 50301 share no factor with it.
- 4
The digits of 50301 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50301 = 3^{7} \times 23 \]50301 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 78720 |
| Euler totient φ(n) | 32076 |
| Square | 2530190601 |
| Cube | 127271117420901 |
| Square root | 224.278844 (= 27√69) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.0301 × |
50301 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and one |
| Binary (base 2) | 1100010001111101 |
| Octal (base 8) | 142175 |
| Hexadecimal (base 16) | C47D |
| Base 3 | 2120000000 |
| As time | 50301 seconds = 13 h 58 min 21 s |
Is 50301 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 (50301 ÷ 3 = 16767) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (50301 ÷ 9 = 5589) | 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 9) | 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 50301 a prime number?
No. 50301 = × 23, so it is divisible by 3.
What are the factors of 50301?
1, 3, 9, 23, 27, 69, 81, 207, 243, 621, 729, 1863, 2187, 5589, 16767, 50301.
What is 50301 in binary?
1100010001111101 (hexadecimal C47D, octal 142175).
What is the square root of 50301?
About 224.2788, exactly 27√69.
Is 50301 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 50301?
50301 is a Harshad number: divisible by its digit sum 9.