The number 14271
14271 is a composite number with 8 divisors. Its prime factorisation is 3 × 67 × 71. Divisors (8): 1, 3, 67, 71, 201, 213, 4757, 14271.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14271 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14271 is composite. Its prime factorisation is
- 3
The divisors add up to 19584; without 14271 itself that is 5313, so 14271 is deficient (5313 is less than 14271). Euler's totient φ(14271) = 9240 numbers up to 14271 share no factor with it.
- 4
The digits of 14271 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 195 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14271 = 3 \times 67 \times 71 \]
14271 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 19584 |
| Euler totient φ(n) | 9240 |
| Square | 203661441 |
| Cube | 2906452424511 |
| Square root | 119.461291 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 195 |
| Scientific notation | 1.4271 × |
14271 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand two hundred and seventy-one |
| Binary (base 2) | 11011110111111 |
| Octal (base 8) | 33677 |
| Hexadecimal (base 16) | 37BF |
| Base 3 | 201120120 |
| As time | 14271 seconds = 3 h 57 min 51 s |
Is 14271 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 | Yes (14271 ÷ 3 = 4757) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14271 a prime number?
No. 14271 = 3 × 67 × 71, so it is divisible by 3.
What are the factors of 14271?
1, 3, 67, 71, 201, 213, 4757, 14271.
What is 14271 in binary?
11011110111111 (hexadecimal 37BF, octal 33677).
What is the square root of 14271?
About 119.4613.
Is 14271 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 14271?
It is a composite number with 8 divisors.