The number 14066
14066 is a composite number with 8 divisors. Its prime factorisation is 2 × 13 × 541. Divisors (8): 1, 2, 13, 26, 541, 1082, 7033, 14066.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14066 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14066 is composite. Its prime factorisation is
- 3
The divisors add up to 22764; without 14066 itself that is 8698, so 14066 is deficient (8698 is less than 14066). Euler's totient φ(14066) = 6480 numbers up to 14066 share no factor with it.
- 4
The digits of 14066 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 107 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14066 = 2 \times 13 \times 541 \]
14066 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 22764 |
| Euler totient φ(n) | 6480 |
| Square | 197852356 |
| Cube | 2782991239496 |
| Square root | 118.600169 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 107 |
| Scientific notation | 1.4066 × |
14066 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand and sixty-six |
| Binary (base 2) | 11011011110010 |
| Octal (base 8) | 33362 |
| Hexadecimal (base 16) | 36F2 |
| Base 3 | 201021222 |
| As time | 14066 seconds = 3 h 54 min 26 s |
Is 14066 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14066 ÷ 2 = 7033) | 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 | No (remainder 1) | 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 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 14066 a prime number?
No. 14066 = 2 × 13 × 541, so it is divisible by 2.
What are the factors of 14066?
1, 2, 13, 26, 541, 1082, 7033, 14066.
What is 14066 in binary?
11011011110010 (hexadecimal 36F2, octal 33362).
What is the square root of 14066?
About 118.6002.
Is 14066 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 14066?
It is a composite number with 8 divisors.