The number 11969
11969 is a twin prime (11969 and 11971 are both prime) and the 1435th prime number. Its only divisors are 1 and 11969.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11969: a twin prime (11969 and 11971 are both prime); the 1435th prime number.
- 2
11969 is prime, so its only factors are 1 and 11969. It is the 1435th prime; the next prime is 11971 and the one before is 11959.
- 3
The divisors add up to 11970; without 11969 itself that is 1, so 11969 is deficient (1 is less than 11969). Euler's totient φ(11969) = 11968 numbers up to 11969 share no factor with it.
- 4
The digits of 11969 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 50 steps to reach 1.
11969 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 11970 |
| Euler totient φ(n) | 11968 |
| Square | 143256961 |
| Cube | 1714642566209 |
| Square root | 109.402925 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 50 |
| Scientific notation | 1.1969 × |
11969 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand nine hundred and sixty-nine |
| Binary (base 2) | 10111011000001 |
| Octal (base 8) | 27301 |
| Hexadecimal (base 16) | 2EC1 |
| Base 3 | 121102022 |
| As time | 11969 seconds = 3 h 19 min 29 s |
Is 11969 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 2) | 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 5) | 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 1) | 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 | No (remainder 9) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11969 a prime number?
Yes. 11969 is divisible only by 1 and itself.
What are the factors of 11969?
1, 11969.
What is 11969 in binary?
10111011000001 (hexadecimal 2EC1, octal 27301).
What is the square root of 11969?
About 109.4029.
Is 11969 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 11969?
11969 is a twin prime (11969 and 11971 are both prime); the 1435th prime number.