The number 12951
12951 is a composite number with 6 divisors. Its prime factorisation is × 1439. Divisors (6): 1, 3, 9, 1439, 4317, 12951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12951 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12951 is composite. Its prime factorisation is
- 3
The divisors add up to 18720; without 12951 itself that is 5769, so 12951 is deficient (5769 is less than 12951). Euler's totient φ(12951) = 8628 numbers up to 12951 share no factor with it.
- 4
The digits of 12951 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 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12951 = 3^{2} \times 1439 \]12951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 18720 |
| Euler totient φ(n) | 8628 |
| Square | 167728401 |
| Cube | 2172250521351 |
| Square root | 113.802460 (= 3√1439) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 50 |
| Scientific notation | 1.2951 × |
12951 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand nine hundred and fifty-one |
| Binary (base 2) | 11001010010111 |
| Octal (base 8) | 31227 |
| Hexadecimal (base 16) | 3297 |
| Base 3 | 122202200 |
| As time | 12951 seconds = 3 h 35 min 51 s |
Is 12951 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 (12951 ÷ 3 = 4317) | 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 1) | 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 | Yes (12951 ÷ 9 = 1439) | 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 12951 a prime number?
No. 12951 = × 1439, so it is divisible by 3.
What are the factors of 12951?
1, 3, 9, 1439, 4317, 12951.
What is 12951 in binary?
11001010010111 (hexadecimal 3297, octal 31227).
What is the square root of 12951?
About 113.8025, exactly 3√1439.
Is 12951 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 12951?
It is a composite number with 6 divisors.