The number 14068
14068 is a composite number with 6 divisors. Its prime factorisation is × 3517. Divisors (6): 1, 2, 4, 3517, 7034, 14068.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14068 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14068 is composite. Its prime factorisation is
- 3
The divisors add up to 24626; without 14068 itself that is 10558, so 14068 is deficient (10558 is less than 14068). Euler's totient φ(14068) = 7032 numbers up to 14068 share no factor with it.
- 4
The digits of 14068 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14068 = 2^{2} \times 3517 \]14068 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 24626 |
| Euler totient φ(n) | 7032 |
| Square | 197908624 |
| Cube | 2784178522432 |
| Square root | 118.608600 (= 2√3517) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 151 |
| Scientific notation | 1.4068 × |
14068 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand and sixty-eight |
| Binary (base 2) | 11011011110100 |
| Octal (base 8) | 33364 |
| Hexadecimal (base 16) | 36F4 |
| Base 3 | 201022001 |
| As time | 14068 seconds = 3 h 54 min 28 s |
Is 14068 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14068 ÷ 2 = 7034) | 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 | Yes (14068 ÷ 4 = 3517) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14068 a prime number?
No. 14068 = × 3517, so it is divisible by 2.
What are the factors of 14068?
1, 2, 4, 3517, 7034, 14068.
What is 14068 in binary?
11011011110100 (hexadecimal 36F4, octal 33364).
What is the square root of 14068?
About 118.6086, exactly 2√3517.
Is 14068 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 14068?
It is a composite number with 6 divisors.