The number 12551
12551 is a composite number with 8 divisors. Its prime factorisation is 7 × 11 × 163. Divisors (8): 1, 7, 11, 77, 163, 1141, 1793, 12551.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12551 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12551 is composite. Its prime factorisation is
- 3
The divisors add up to 15744; without 12551 itself that is 3193, so 12551 is deficient (3193 is less than 12551). Euler's totient φ(12551) = 9720 numbers up to 12551 share no factor with it.
- 4
The digits of 12551 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 156 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12551 = 7 \times 11 \times 163 \]
12551 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 15744 |
| Euler totient φ(n) | 9720 |
| Square | 157527601 |
| Cube | 1977128920151 |
| Square root | 112.031246 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 156 |
| Scientific notation | 1.2551 × |
12551 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand five hundred and fifty-one |
| Binary (base 2) | 11000100000111 |
| Octal (base 8) | 30407 |
| Hexadecimal (base 16) | 3107 |
| Base 3 | 122012212 |
| As time | 12551 seconds = 3 h 29 min 11 s |
Is 12551 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (12551 ÷ 7 = 1793) | 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 5) | 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 (12551 ÷ 11 = 1141) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12551 a prime number?
No. 12551 = 7 × 11 × 163, so it is divisible by 7.
What are the factors of 12551?
1, 7, 11, 77, 163, 1141, 1793, 12551.
What is 12551 in binary?
11000100000111 (hexadecimal 3107, octal 30407).
What is the square root of 12551?
About 112.0312.
Is 12551 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 12551?
It is a composite number with 8 divisors.