The number 1970
1970 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 197. Divisors (8): 1, 2, 5, 10, 197, 394, 985, 1970.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1970 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1970 is composite. Its prime factorisation is
- 3
The divisors add up to 3564; without 1970 itself that is 1594, so 1970 is deficient (1594 is less than 1970). Euler's totient φ(1970) = 784 numbers up to 1970 share no factor with it.
- 4
The digits of 1970 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 24 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1970 = 2 \times 5 \times 197 \]
1970 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 3564 |
| Euler totient φ(n) | 784 |
| Square | 3880900 |
| Cube | 7645373000 |
| Square root | 44.384682 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 24 |
| Scientific notation | 1.97 × |
1970 in other forms
| Form | Value |
|---|---|
| In words | one thousand nine hundred and seventy |
| Roman numerals | MCMLXX |
| Binary (base 2) | 11110110010 |
| Octal (base 8) | 3662 |
| Hexadecimal (base 16) | 7B2 |
| Base 3 | 2200222 |
| As time | 1970 seconds = 32 min 50 s |
Is 1970 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1970 ÷ 2 = 985) | 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 (1970 ÷ 5 = 394) | 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 3) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (1970 ÷ 10 = 197) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1970 a prime number?
No. 1970 = 2 × 5 × 197, so it is divisible by 2.
What are the factors of 1970?
1, 2, 5, 10, 197, 394, 985, 1970.
What is 1970 in binary?
11110110010 (hexadecimal 7B2, octal 3662).
What is the square root of 1970?
About 44.3847.
What is 1970 in Roman numerals?
MCMLXX.
Is 1970 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 1970?
It is a composite number with 8 divisors.