The number 50070
50070 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 1669. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 1669, 3338, 5007, 8345, 10014, 16690, 25035, 50070.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50070 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50070 is composite. Its prime factorisation is
- 3
The divisors add up to 120240; without 50070 itself that is 70170, so 50070 is abundant (70170 is more than 50070). Euler's totient φ(50070) = 13344 numbers up to 50070 share no factor with it.
- 4
The digits of 50070 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50070 = 2 \times 3 \times 5 \times 1669 \]
50070 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 120240 |
| Euler totient φ(n) | 13344 |
| Square | 2507004900 |
| Cube | 125525735343000 |
| Square root | 223.763268 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.007 × |
50070 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and seventy |
| Binary (base 2) | 1100001110010110 |
| Octal (base 8) | 141626 |
| Hexadecimal (base 16) | C396 |
| Base 3 | 2112200110 |
| As time | 50070 seconds = 13 h 54 min 30 s |
Is 50070 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50070 ÷ 2 = 25035) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50070 ÷ 3 = 16690) | 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 (50070 ÷ 5 = 10014) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (50070 ÷ 6 = 8345) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (50070 ÷ 10 = 5007) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50070 a prime number?
No. 50070 = 2 × 3 × 5 × 1669, so it is divisible by 2.
What are the factors of 50070?
1, 2, 3, 5, 6, 10, 15, 30, 1669, 3338, 5007, 8345, 10014, 16690, 25035, 50070.
What is 50070 in binary?
1100001110010110 (hexadecimal C396, octal 141626).
What is the square root of 50070?
About 223.7633.
Is 50070 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 50070?
It is a composite number with 16 divisors.