The number 10551
10551 is a composite number with 4 divisors. Its prime factorisation is 3 × 3517. Divisors (4): 1, 3, 3517, 10551.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10551: a semiprime: 3 × 3517, the product of two primes.
- 2
10551 is composite. Its prime factorisation is
- 3
The divisors add up to 14072; without 10551 itself that is 3521, so 10551 is deficient (3521 is less than 10551). Euler's totient φ(10551) = 7032 numbers up to 10551 share no factor with it.
- 4
The digits of 10551 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 104 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10551 = 3 \times 3517 \]
10551 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 14072 |
| Euler totient φ(n) | 7032 |
| Square | 111323601 |
| Cube | 1174575314151 |
| Square root | 102.718061 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 104 |
| Scientific notation | 1.0551 × |
10551 in other forms
| Form | Value |
|---|---|
| In words | ten thousand five hundred and fifty-one |
| Binary (base 2) | 10100100110111 |
| Octal (base 8) | 24467 |
| Hexadecimal (base 16) | 2937 |
| Base 3 | 112110210 |
| As time | 10551 seconds = 2 h 55 min 51 s |
Is 10551 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 (10551 ÷ 3 = 3517) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 2) | 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 10551 a prime number?
No. 10551 = 3 × 3517, so it is divisible by 3.
What are the factors of 10551?
1, 3, 3517, 10551.
What is 10551 in binary?
10100100110111 (hexadecimal 2937, octal 24467).
What is the square root of 10551?
About 102.7181.
Is 10551 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 10551?
10551 is a semiprime: 3 × 3517, the product of two primes.