The number 50373
50373 is a composite number with 12 divisors. Its prime factorisation is × 29 × 193. Divisors (12): 1, 3, 9, 29, 87, 193, 261, 579, 1737, 5597, 16791, 50373.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50373 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50373 is composite. Its prime factorisation is
- 3
The divisors add up to 75660; without 50373 itself that is 25287, so 50373 is deficient (25287 is less than 50373). Euler's totient φ(50373) = 32256 numbers up to 50373 share no factor with it.
- 4
The digits of 50373 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50373 = 3^{2} \times 29 \times 193 \]50373 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 75660 |
| Euler totient φ(n) | 32256 |
| Square | 2537439129 |
| Cube | 127818421245117 |
| Square root | 224.439301 (= 3√5597) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0373 × |
50373 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and seventy-three |
| Binary (base 2) | 1100010011000101 |
| Octal (base 8) | 142305 |
| Hexadecimal (base 16) | C4C5 |
| Base 3 | 2120002200 |
| As time | 50373 seconds = 13 h 59 min 33 s |
Is 50373 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 (50373 ÷ 3 = 16791) | 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 1) | 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 (50373 ÷ 9 = 5597) | 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 4) | 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 50373 a prime number?
No. 50373 = × 29 × 193, so it is divisible by 3.
What are the factors of 50373?
1, 3, 9, 29, 87, 193, 261, 579, 1737, 5597, 16791, 50373.
What is 50373 in binary?
1100010011000101 (hexadecimal C4C5, octal 142305).
What is the square root of 50373?
About 224.4393, exactly 3√5597.
Is 50373 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 50373?
It is a composite number with 12 divisors.