The number 14871
14871 is a binary palindrome (11101000010111). Its prime factorisation is 3 × 4957. Divisors (4): 1, 3, 4957, 14871.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14871: a binary palindrome (11101000010111); a semiprime: 3 × 4957, the product of two primes.
- 2
14871 is composite. Its prime factorisation is
- 3
The divisors add up to 19832; without 14871 itself that is 4961, so 14871 is deficient (4961 is less than 14871). Euler's totient φ(14871) = 9912 numbers up to 14871 share no factor with it.
- 4
The digits of 14871 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14871 = 3 \times 4957 \]
14871 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 19832 |
| Euler totient φ(n) | 9912 |
| Square | 221146641 |
| Cube | 3288671698311 |
| Square root | 121.946710 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 45 |
| Scientific notation | 1.4871 × |
14871 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand eight hundred and seventy-one |
| Binary (base 2) | 11101000010111 |
| Octal (base 8) | 35027 |
| Hexadecimal (base 16) | 3A17 |
| Base 3 | 202101210 |
| As time | 14871 seconds = 4 h 7 min 51 s |
Is 14871 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 (14871 ÷ 3 = 4957) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 10) | 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 14871 a prime number?
No. 14871 = 3 × 4957, so it is divisible by 3.
What are the factors of 14871?
1, 3, 4957, 14871.
What is 14871 in binary?
11101000010111 (hexadecimal 3A17, octal 35027).
What is the square root of 14871?
About 121.9467.
Is 14871 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 14871?
14871 is a binary palindrome (11101000010111); a semiprime: 3 × 4957, the product of two primes.