The number 55751
55751 is a composite number with 4 divisors. Its prime factorisation is 197 × 283. Divisors (4): 1, 197, 283, 55751.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55751: a semiprime: 197 × 283, the product of two primes.
- 2
55751 is composite. Its prime factorisation is
- 3
The divisors add up to 56232; without 55751 itself that is 481, so 55751 is deficient (481 is less than 55751). Euler's totient φ(55751) = 55272 numbers up to 55751 share no factor with it.
- 4
The digits of 55751 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55751 = 197 \times 283 \]
55751 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 56232 |
| Euler totient φ(n) | 55272 |
| Square | 3108174001 |
| Cube | 173283808729751 |
| Square root | 236.116497 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 135 |
| Scientific notation | 5.5751 × |
55751 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand seven hundred and fifty-one |
| Binary (base 2) | 1101100111000111 |
| Octal (base 8) | 154707 |
| Hexadecimal (base 16) | D9C7 |
| Base 3 | 2211110212 |
| As time | 55751 seconds = 15 h 29 min 11 s |
Is 55751 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 | No (remainder 3) | 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 | No (remainder 3) | 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 55751 a prime number?
No. 55751 = 197 × 283, so it is divisible by 197.
What are the factors of 55751?
1, 197, 283, 55751.
What is 55751 in binary?
1101100111000111 (hexadecimal D9C7, octal 154707).
What is the square root of 55751?
About 236.1165.
Is 55751 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 55751?
55751 is a semiprime: 197 × 283, the product of two primes.