The number 55571
55571 is a composite number with 4 divisors. Its prime factorisation is 61 × 911. Divisors (4): 1, 61, 911, 55571.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55571: a semiprime: 61 × 911, the product of two primes.
- 2
55571 is composite. Its prime factorisation is
- 3
The divisors add up to 56544; without 55571 itself that is 973, so 55571 is deficient (973 is less than 55571). Euler's totient φ(55571) = 54600 numbers up to 55571 share no factor with it.
- 4
The digits of 55571 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 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55571 = 61 \times 911 \]
55571 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 56544 |
| Euler totient φ(n) | 54600 |
| Square | 3088136041 |
| Cube | 171610807934411 |
| Square root | 235.735021 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.5571 × |
55571 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand five hundred and seventy-one |
| Binary (base 2) | 1101100100010011 |
| Octal (base 8) | 154423 |
| Hexadecimal (base 16) | D913 |
| Base 3 | 2211020012 |
| As time | 55571 seconds = 15 h 26 min 11 s |
Is 55571 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 5) | 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 | 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 10) | 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 55571 a prime number?
No. 55571 = 61 × 911, so it is divisible by 61.
What are the factors of 55571?
1, 61, 911, 55571.
What is 55571 in binary?
1101100100010011 (hexadecimal D913, octal 154423).
What is the square root of 55571?
About 235.7350.
Is 55571 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 55571?
55571 is a semiprime: 61 × 911, the product of two primes.