The number 14267
14267 is a composite number with 4 divisors. Its prime factorisation is 11 × 1297. Divisors (4): 1, 11, 1297, 14267.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14267: a semiprime: 11 × 1297, the product of two primes.
- 2
14267 is composite. Its prime factorisation is
- 3
The divisors add up to 15576; without 14267 itself that is 1309, so 14267 is deficient (1309 is less than 14267). Euler's totient φ(14267) = 12960 numbers up to 14267 share no factor with it.
- 4
The digits of 14267 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 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14267 = 11 \times 1297 \]
14267 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15576 |
| Euler totient φ(n) | 12960 |
| Square | 203547289 |
| Cube | 2904009172163 |
| Square root | 119.444548 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 50 |
| Scientific notation | 1.4267 × |
14267 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand two hundred and sixty-seven |
| Binary (base 2) | 11011110111011 |
| Octal (base 8) | 33673 |
| Hexadecimal (base 16) | 37BB |
| Base 3 | 201120102 |
| As time | 14267 seconds = 3 h 57 min 47 s |
Is 14267 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 1) | 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 3) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (14267 ÷ 11 = 1297) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14267 a prime number?
No. 14267 = 11 × 1297, so it is divisible by 11.
What are the factors of 14267?
1, 11, 1297, 14267.
What is 14267 in binary?
11011110111011 (hexadecimal 37BB, octal 33673).
What is the square root of 14267?
About 119.4445.
Is 14267 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 14267?
14267 is a semiprime: 11 × 1297, the product of two primes.