The number 8070
8070 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 269. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 269, 538, 807, 1345, 1614, 2690, 4035, 8070.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 8070: a Harshad number: divisible by its digit sum 15.
- 2
8070 is composite. Its prime factorisation is
- 3
The divisors add up to 19440; without 8070 itself that is 11370, so 8070 is abundant (11370 is more than 8070). Euler's totient φ(8070) = 2144 numbers up to 8070 share no factor with it.
- 4
The digits of 8070 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 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 8070 = 2 \times 3 \times 5 \times 269 \]
8070 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 19440 |
| Euler totient φ(n) | 2144 |
| Square | 65124900 |
| Cube | 525557943000 |
| Square root | 89.833179 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 70 |
| Scientific notation | 8.07 × |
8070 in other forms
| Form | Value |
|---|---|
| In words | eight thousand and seventy |
| Binary (base 2) | 1111110000110 |
| Octal (base 8) | 17606 |
| Hexadecimal (base 16) | 1F86 |
| Base 3 | 102001220 |
| As time | 8070 seconds = 2 h 14 min 30 s |
Is 8070 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (8070 ÷ 2 = 4035) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (8070 ÷ 3 = 2690) | 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 (8070 ÷ 5 = 1614) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (8070 ÷ 6 = 1345) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (8070 ÷ 10 = 807) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 8070 a prime number?
No. 8070 = 2 × 3 × 5 × 269, so it is divisible by 2.
What are the factors of 8070?
1, 2, 3, 5, 6, 10, 15, 30, 269, 538, 807, 1345, 1614, 2690, 4035, 8070.
What is 8070 in binary?
1111110000110 (hexadecimal 1F86, octal 17606).
What is the square root of 8070?
About 89.8332.
Is 8070 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 8070?
8070 is a Harshad number: divisible by its digit sum 15.