The number 14069
14069 is a composite number with 4 divisors. Its prime factorisation is 11 × 1279. Divisors (4): 1, 11, 1279, 14069.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14069: a semiprime: 11 × 1279, the product of two primes.
- 2
14069 is composite. Its prime factorisation is
- 3
The divisors add up to 15360; without 14069 itself that is 1291, so 14069 is deficient (1291 is less than 14069). Euler's totient φ(14069) = 12780 numbers up to 14069 share no factor with it.
- 4
The digits of 14069 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14069 = 11 \times 1279 \]
14069 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15360 |
| Euler totient φ(n) | 12780 |
| Square | 197936761 |
| Cube | 2784772290509 |
| Square root | 118.612815 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 151 |
| Scientific notation | 1.4069 × |
14069 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand and sixty-nine |
| Binary (base 2) | 11011011110101 |
| Octal (base 8) | 33365 |
| Hexadecimal (base 16) | 36F5 |
| Base 3 | 201022002 |
| As time | 14069 seconds = 3 h 54 min 29 s |
Is 14069 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 (14069 ÷ 11 = 1279) | 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 14069 a prime number?
No. 14069 = 11 × 1279, so it is divisible by 11.
What are the factors of 14069?
1, 11, 1279, 14069.
What is 14069 in binary?
11011011110101 (hexadecimal 36F5, octal 33365).
What is the square root of 14069?
About 118.6128.
Is 14069 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 14069?
14069 is a semiprime: 11 × 1279, the product of two primes.