The number 80070
80070 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 5 × 17 × 157. Divisors (32): 1, 2, 3, 5, 6, 10, 15, 17, 30, 34, 51, 85, 102, 157, 170, 255 … 80070.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 80070: a Harshad number: divisible by its digit sum 15.
- 2
80070 is composite. Its prime factorisation is
- 3
The divisors add up to 204768; without 80070 itself that is 124698, so 80070 is abundant (124698 is more than 80070). Euler's totient φ(80070) = 19968 numbers up to 80070 share no factor with it.
- 4
The digits of 80070 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 169 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80070 = 2 \times 3 \times 5 \times 17 \times 157 \]
80070 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 204768 |
| Euler totient φ(n) | 19968 |
| Square | 6411204900 |
| Cube | 513345176343000 |
| Square root | 282.966429 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 169 |
| Scientific notation | 8.007 × |
80070 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand and seventy |
| Binary (base 2) | 10011100011000110 |
| Octal (base 8) | 234306 |
| Hexadecimal (base 16) | 138C6 |
| Base 3 | 11001211120 |
| As time | 80070 seconds = 22 h 14 min 30 s |
Is 80070 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (80070 ÷ 2 = 40035) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (80070 ÷ 3 = 26690) | 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 (80070 ÷ 5 = 16014) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (80070 ÷ 6 = 13345) | 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 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (80070 ÷ 10 = 8007) | 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 80070 a prime number?
No. 80070 = 2 × 3 × 5 × 17 × 157, so it is divisible by 2.
What are the factors of 80070?
1, 2, 3, 5, 6, 10, 15, 17, 30, 34, 51, 85, 102, 157, 170, 255, 314, 471, 510, 785, 942, 1570, 2355, 2669, 4710, 5338, 8007, 13345, 16014, 26690, 40035, 80070.
What is 80070 in binary?
10011100011000110 (hexadecimal 138C6, octal 234306).
What is the square root of 80070?
About 282.9664.
Is 80070 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 80070?
80070 is a Harshad number: divisible by its digit sum 15.