The number 50370
50370 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 5 × 23 × 73. Divisors (32): 1, 2, 3, 5, 6, 10, 15, 23, 30, 46, 69, 73, 115, 138, 146, 219 … 50370.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50370: a Harshad number: divisible by its digit sum 15.
- 2
50370 is composite. Its prime factorisation is
- 3
The divisors add up to 127872; without 50370 itself that is 77502, so 50370 is abundant (77502 is more than 50370). Euler's totient φ(50370) = 12672 numbers up to 50370 share no factor with it.
- 4
The digits of 50370 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
\[ 50370 = 2 \times 3 \times 5 \times 23 \times 73 \]
50370 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 127872 |
| Euler totient φ(n) | 12672 |
| Square | 2537136900 |
| Cube | 127795585653000 |
| Square root | 224.432618 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.037 × |
50370 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and seventy |
| Binary (base 2) | 1100010011000010 |
| Octal (base 8) | 142302 |
| Hexadecimal (base 16) | C4C2 |
| Base 3 | 2120002120 |
| As time | 50370 seconds = 13 h 59 min 30 s |
Is 50370 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50370 ÷ 2 = 25185) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50370 ÷ 3 = 16790) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (50370 ÷ 5 = 10074) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (50370 ÷ 6 = 8395) | 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 2) | 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 | Yes (50370 ÷ 10 = 5037) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50370 a prime number?
No. 50370 = 2 × 3 × 5 × 23 × 73, so it is divisible by 2.
What are the factors of 50370?
1, 2, 3, 5, 6, 10, 15, 23, 30, 46, 69, 73, 115, 138, 146, 219, 230, 345, 365, 438, 690, 730, 1095, 1679, 2190, 3358, 5037, 8395, 10074, 16790, 25185, 50370.
What is 50370 in binary?
1100010011000010 (hexadecimal C4C2, octal 142302).
What is the square root of 50370?
About 224.4326.
Is 50370 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 50370?
50370 is a Harshad number: divisible by its digit sum 15.