The number 55251
55251 is a composite number with 12 divisors. Its prime factorisation is × 7 × 877. Divisors (12): 1, 3, 7, 9, 21, 63, 877, 2631, 6139, 7893, 18417, 55251.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55251 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55251 is composite. Its prime factorisation is
- 3
The divisors add up to 91312; without 55251 itself that is 36061, so 55251 is deficient (36061 is less than 55251). Euler's totient φ(55251) = 31536 numbers up to 55251 share no factor with it.
- 4
The digits of 55251 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55251 = 3^{2} \times 7 \times 877 \]55251 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 91312 |
| Euler totient φ(n) | 31536 |
| Square | 3052673001 |
| Cube | 168663235978251 |
| Square root | 235.055313 (= 3√6139) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.5251 × |
55251 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand two hundred and fifty-one |
| Binary (base 2) | 1101011111010011 |
| Octal (base 8) | 153723 |
| Hexadecimal (base 16) | D7D3 |
| Base 3 | 2210210100 |
| As time | 55251 seconds = 15 h 20 min 51 s |
Is 55251 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 (55251 ÷ 3 = 18417) | 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 | Yes (55251 ÷ 7 = 7893) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (55251 ÷ 9 = 6139) | 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 9) | 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 55251 a prime number?
No. 55251 = × 7 × 877, so it is divisible by 3.
What are the factors of 55251?
1, 3, 7, 9, 21, 63, 877, 2631, 6139, 7893, 18417, 55251.
What is 55251 in binary?
1101011111010011 (hexadecimal D7D3, octal 153723).
What is the square root of 55251?
About 235.0553, exactly 3√6139.
Is 55251 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 55251?
It is a composite number with 12 divisors.