The number 1969
1969 is a composite number with 4 divisors. Its prime factorisation is 11 × 179. Divisors (4): 1, 11, 179, 1969.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1969: a semiprime: 11 × 179, the product of two primes.
- 2
1969 is composite. Its prime factorisation is
- 3
The divisors add up to 2160; without 1969 itself that is 191, so 1969 is deficient (191 is less than 1969). Euler's totient φ(1969) = 1780 numbers up to 1969 share no factor with it.
- 4
The digits of 1969 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 24 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1969 = 11 \times 179 \]
1969 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 2160 |
| Euler totient φ(n) | 1780 |
| Square | 3876961 |
| Cube | 7633736209 |
| Square root | 44.373415 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 24 |
| Scientific notation | 1.969 × |
1969 in other forms
| Form | Value |
|---|---|
| In words | one thousand nine hundred and sixty-nine |
| Roman numerals | MCMLXIX |
| Binary (base 2) | 11110110001 |
| Octal (base 8) | 3661 |
| Hexadecimal (base 16) | 7B1 |
| Base 3 | 2200221 |
| As time | 1969 seconds = 32 min 49 s |
Is 1969 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (1969 ÷ 11 = 179) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1969 a prime number?
No. 1969 = 11 × 179, so it is divisible by 11.
What are the factors of 1969?
1, 11, 179, 1969.
What is 1969 in binary?
11110110001 (hexadecimal 7B1, octal 3661).
What is the square root of 1969?
About 44.3734.
What is 1969 in Roman numerals?
MCMLXIX.
Is 1969 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 1969?
1969 is a semiprime: 11 × 179, the product of two primes.