The number 12872
12872 is a composite number with 8 divisors. Its prime factorisation is × 1609. Divisors (8): 1, 2, 4, 8, 1609, 3218, 6436, 12872.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12872 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12872 is composite. Its prime factorisation is
- 3
The divisors add up to 24150; without 12872 itself that is 11278, so 12872 is deficient (11278 is less than 12872). Euler's totient φ(12872) = 6432 numbers up to 12872 share no factor with it.
- 4
The digits of 12872 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 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12872 = 2^{3} \times 1609 \]12872 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 24150 |
| Euler totient φ(n) | 6432 |
| Square | 165688384 |
| Cube | 2132740878848 |
| Square root | 113.454837 (= 2√3218) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 76 |
| Scientific notation | 1.2872 × |
12872 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand eight hundred and seventy-two |
| Binary (base 2) | 11001001001000 |
| Octal (base 8) | 31110 |
| Hexadecimal (base 16) | 3248 |
| Base 3 | 122122202 |
| As time | 12872 seconds = 3 h 34 min 32 s |
Is 12872 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12872 ÷ 2 = 6436) | 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 | Yes (12872 ÷ 4 = 3218) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 | Yes (12872 ÷ 8 = 1609) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12872 a prime number?
No. 12872 = × 1609, so it is divisible by 2.
What are the factors of 12872?
1, 2, 4, 8, 1609, 3218, 6436, 12872.
What is 12872 in binary?
11001001001000 (hexadecimal 3248, octal 31110).
What is the square root of 12872?
About 113.4548, exactly 2√3218.
Is 12872 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 12872?
It is a composite number with 8 divisors.