The number 50670
50670 is a composite number with 24 divisors. Its prime factorisation is 2 × × 5 × 563. Divisors (24): 1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90, 563, 1126, 1689, 2815 … 50670.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50670: a Harshad number: divisible by its digit sum 18.
- 2
50670 is composite. Its prime factorisation is
- 3
The divisors add up to 131976; without 50670 itself that is 81306, so 50670 is abundant (81306 is more than 50670). Euler's totient φ(50670) = 13488 numbers up to 50670 share no factor with it.
- 4
The digits of 50670 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 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50670 = 2 \times 3^{2} \times 5 \times 563 \]50670 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 131976 |
| Euler totient φ(n) | 13488 |
| Square | 2567448900 |
| Cube | 130092635763000 |
| Square root | 225.099978 (= 3√5630) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 57 |
| Scientific notation | 5.067 × |
50670 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand six hundred and seventy |
| Binary (base 2) | 1100010111101110 |
| Octal (base 8) | 142756 |
| Hexadecimal (base 16) | C5EE |
| Base 3 | 2120111200 |
| As time | 50670 seconds = 14 h 4 min 30 s |
Is 50670 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50670 ÷ 2 = 25335) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50670 ÷ 3 = 16890) | 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 (50670 ÷ 5 = 10134) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (50670 ÷ 6 = 8445) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (50670 ÷ 9 = 5630) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (50670 ÷ 10 = 5067) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50670 a prime number?
No. 50670 = 2 × × 5 × 563, so it is divisible by 2.
What are the factors of 50670?
1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90, 563, 1126, 1689, 2815, 3378, 5067, 5630, 8445, 10134, 16890, 25335, 50670.
What is 50670 in binary?
1100010111101110 (hexadecimal C5EE, octal 142756).
What is the square root of 50670?
About 225.1000, exactly 3√5630.
Is 50670 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 50670?
50670 is a Harshad number: divisible by its digit sum 18.