The number 50073
50073 is a composite number with 4 divisors. Its prime factorisation is 3 × 16691. Divisors (4): 1, 3, 16691, 50073.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50073: a semiprime: 3 × 16691, the product of two primes.
- 2
50073 is composite. Its prime factorisation is
- 3
The divisors add up to 66768; without 50073 itself that is 16695, so 50073 is deficient (16695 is less than 50073). Euler's totient φ(50073) = 33380 numbers up to 50073 share no factor with it.
- 4
The digits of 50073 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50073 = 3 \times 16691 \]
50073 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 66768 |
| Euler totient φ(n) | 33380 |
| Square | 2507305329 |
| Cube | 125548299739017 |
| Square root | 223.769971 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0073 × |
50073 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and seventy-three |
| Binary (base 2) | 1100001110011001 |
| Octal (base 8) | 141631 |
| Hexadecimal (base 16) | C399 |
| Base 3 | 2112200120 |
| As time | 50073 seconds = 13 h 54 min 33 s |
Is 50073 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 (50073 ÷ 3 = 16691) | 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 3) | 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 2) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 50073 a prime number?
No. 50073 = 3 × 16691, so it is divisible by 3.
What are the factors of 50073?
1, 3, 16691, 50073.
What is 50073 in binary?
1100001110011001 (hexadecimal C399, octal 141631).
What is the square root of 50073?
About 223.7700.
Is 50073 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 50073?
50073 is a semiprime: 3 × 16691, the product of two primes.