The number 14971
14971 is a composite number with 4 divisors. Its prime factorisation is 11 × 1361. Divisors (4): 1, 11, 1361, 14971.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14971: a semiprime: 11 × 1361, the product of two primes.
- 2
14971 is composite. Its prime factorisation is
- 3
The divisors add up to 16344; without 14971 itself that is 1373, so 14971 is deficient (1373 is less than 14971). Euler's totient φ(14971) = 13600 numbers up to 14971 share no factor with it.
- 4
The digits of 14971 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14971 = 11 \times 1361 \]
14971 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16344 |
| Euler totient φ(n) | 13600 |
| Square | 224130841 |
| Cube | 3355462820611 |
| Square root | 122.356038 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.4971 × |
14971 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand nine hundred and seventy-one |
| Binary (base 2) | 11101001111011 |
| Octal (base 8) | 35173 |
| Hexadecimal (base 16) | 3A7B |
| Base 3 | 202112111 |
| As time | 14971 seconds = 4 h 9 min 31 s |
Is 14971 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 1) | 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 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 | Yes (14971 ÷ 11 = 1361) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14971 a prime number?
No. 14971 = 11 × 1361, so it is divisible by 11.
What are the factors of 14971?
1, 11, 1361, 14971.
What is 14971 in binary?
11101001111011 (hexadecimal 3A7B, octal 35173).
What is the square root of 14971?
About 122.3560.
Is 14971 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 14971?
14971 is a semiprime: 11 × 1361, the product of two primes.