The number 70050
70050 is a composite number with 24 divisors. Its prime factorisation is 2 × 3 × × 467. Divisors (24): 1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150, 467, 934, 1401, 2335 … 70050.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
70050 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
70050 is composite. Its prime factorisation is
- 3
The divisors add up to 174096; without 70050 itself that is 104046, so 70050 is abundant (104046 is more than 70050). Euler's totient φ(70050) = 18640 numbers up to 70050 share no factor with it.
- 4
The digits of 70050 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 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 70050 = 2 \times 3 \times 5^{2} \times 467 \]70050 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 174096 |
| Euler totient φ(n) | 18640 |
| Square | 4907002500 |
| Cube | 343735525125000 |
| Square root | 264.669605 (= 5√2802) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 81 |
| Scientific notation | 7.005 × |
70050 in other forms
| Form | Value |
|---|---|
| In words | seventy thousand and fifty |
| Binary (base 2) | 10001000110100010 |
| Octal (base 8) | 210642 |
| Hexadecimal (base 16) | 111A2 |
| Base 3 | 10120002110 |
| As time | 70050 seconds = 19 h 27 min 30 s |
Is 70050 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (70050 ÷ 2 = 35025) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (70050 ÷ 3 = 23350) | 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 (70050 ÷ 5 = 14010) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (70050 ÷ 6 = 11675) | 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 2) | 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 (70050 ÷ 10 = 7005) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 70050 a prime number?
No. 70050 = 2 × 3 × × 467, so it is divisible by 2.
What are the factors of 70050?
1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150, 467, 934, 1401, 2335, 2802, 4670, 7005, 11675, 14010, 23350, 35025, 70050.
What is 70050 in binary?
10001000110100010 (hexadecimal 111A2, octal 210642).
What is the square root of 70050?
About 264.6696, exactly 5√2802.
Is 70050 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 70050?
It is a composite number with 24 divisors.