The number 5551
5551 is a composite number with 8 divisors. Its prime factorisation is 7 × 13 × 61. Divisors (8): 1, 7, 13, 61, 91, 427, 793, 5551.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5551 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5551 is composite. Its prime factorisation is
- 3
The divisors add up to 6944; without 5551 itself that is 1393, so 5551 is deficient (1393 is less than 5551). Euler's totient φ(5551) = 4320 numbers up to 5551 share no factor with it.
- 4
The digits of 5551 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 67 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5551 = 7 \times 13 \times 61 \]
5551 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 6944 |
| Euler totient φ(n) | 4320 |
| Square | 30813601 |
| Cube | 171046299151 |
| Square root | 74.505033 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 67 |
| Scientific notation | 5.551 × |
5551 in other forms
| Form | Value |
|---|---|
| In words | five thousand five hundred and fifty-one |
| Binary (base 2) | 1010110101111 |
| Octal (base 8) | 12657 |
| Hexadecimal (base 16) | 15AF |
| Base 3 | 21121121 |
| As time | 5551 seconds = 1 h 32 min 31 s |
Is 5551 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (5551 ÷ 7 = 793) | 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 7) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5551 a prime number?
No. 5551 = 7 × 13 × 61, so it is divisible by 7.
What are the factors of 5551?
1, 7, 13, 61, 91, 427, 793, 5551.
What is 5551 in binary?
1010110101111 (hexadecimal 15AF, octal 12657).
What is the square root of 5551?
About 74.5050.
Is 5551 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 5551?
It is a composite number with 8 divisors.