The number 1070
1070 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 107. Divisors (8): 1, 2, 5, 10, 107, 214, 535, 1070.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1070 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1070 is composite. Its prime factorisation is
- 3
The divisors add up to 1944; without 1070 itself that is 874, so 1070 is deficient (874 is less than 1070). Euler's totient φ(1070) = 424 numbers up to 1070 share no factor with it.
- 4
The digits of 1070 add up to 8, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 23 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1070 = 2 \times 5 \times 107 \]
1070 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 1944 |
| Euler totient φ(n) | 424 |
| Square | 1144900 |
| Cube | 1225043000 |
| Square root | 32.710854 |
| Digit sum / digital root | 8 / 8 |
| Collatz steps to 1 | 23 |
| Scientific notation | 1.07 × |
1070 in other forms
| Form | Value |
|---|---|
| In words | one thousand and seventy |
| Roman numerals | MLXX |
| Binary (base 2) | 10000101110 |
| Octal (base 8) | 2056 |
| Hexadecimal (base 16) | 42E |
| Base 3 | 1110122 |
| As time | 1070 seconds = 17 min 50 s |
Is 1070 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1070 ÷ 2 = 535) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 (1070 ÷ 5 = 214) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (1070 ÷ 10 = 107) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1070 a prime number?
No. 1070 = 2 × 5 × 107, so it is divisible by 2.
What are the factors of 1070?
1, 2, 5, 10, 107, 214, 535, 1070.
What is 1070 in binary?
10000101110 (hexadecimal 42E, octal 2056).
What is the square root of 1070?
About 32.7109.
What is 1070 in Roman numerals?
MLXX.
Is 1070 divisible by 3?
No. Its digits add up to 8, which is not a multiple of 3.
What is special about the number 1070?
It is a composite number with 8 divisors.