The number 10971
10971 is a composite number with 12 divisors. Its prime factorisation is × 23 × 53. Divisors (12): 1, 3, 9, 23, 53, 69, 159, 207, 477, 1219, 3657, 10971.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10971 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10971 is composite. Its prime factorisation is
- 3
The divisors add up to 16848; without 10971 itself that is 5877, so 10971 is deficient (5877 is less than 10971). Euler's totient φ(10971) = 6864 numbers up to 10971 share no factor with it.
- 4
The digits of 10971 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 267 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10971 = 3^{2} \times 23 \times 53 \]10971 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 16848 |
| Euler totient φ(n) | 6864 |
| Square | 120362841 |
| Cube | 1320500728611 |
| Square root | 104.742542 (= 3√1219) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 267 |
| Scientific notation | 1.0971 × |
10971 in other forms
| Form | Value |
|---|---|
| In words | ten thousand nine hundred and seventy-one |
| Binary (base 2) | 10101011011011 |
| Octal (base 8) | 25333 |
| Hexadecimal (base 16) | 2ADB |
| Base 3 | 120001100 |
| As time | 10971 seconds = 3 h 2 min 51 s |
Is 10971 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 (10971 ÷ 3 = 3657) | 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 2) | 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 | Yes (10971 ÷ 9 = 1219) | 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 10971 a prime number?
No. 10971 = × 23 × 53, so it is divisible by 3.
What are the factors of 10971?
1, 3, 9, 23, 53, 69, 159, 207, 477, 1219, 3657, 10971.
What is 10971 in binary?
10101011011011 (hexadecimal 2ADB, octal 25333).
What is the square root of 10971?
About 104.7425, exactly 3√1219.
Is 10971 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 10971?
It is a composite number with 12 divisors.