The number 55971
55971 is a composite number with 10 divisors. Its prime factorisation is × 691. Divisors (10): 1, 3, 9, 27, 81, 691, 2073, 6219, 18657, 55971.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55971: a Harshad number: divisible by its digit sum 27.
- 2
55971 is composite. Its prime factorisation is
- 3
The divisors add up to 83732; without 55971 itself that is 27761, so 55971 is deficient (27761 is less than 55971). Euler's totient φ(55971) = 37260 numbers up to 55971 share no factor with it.
- 4
The digits of 55971 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55971 = 3^{4} \times 691 \]55971 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 83732 |
| Euler totient φ(n) | 37260 |
| Square | 3132752841 |
| Cube | 175343309263611 |
| Square root | 236.581910 (= 9√691) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.5971 × |
55971 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and seventy-one |
| Binary (base 2) | 1101101010100011 |
| Octal (base 8) | 155243 |
| Hexadecimal (base 16) | DAA3 |
| Base 3 | 2211210000 |
| As time | 55971 seconds = 15 h 32 min 51 s |
Is 55971 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 (55971 ÷ 3 = 18657) | 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 6) | 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 (55971 ÷ 9 = 6219) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55971 a prime number?
No. 55971 = × 691, so it is divisible by 3.
What are the factors of 55971?
1, 3, 9, 27, 81, 691, 2073, 6219, 18657, 55971.
What is 55971 in binary?
1101101010100011 (hexadecimal DAA3, octal 155243).
What is the square root of 55971?
About 236.5819, exactly 9√691.
Is 55971 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 55971?
55971 is a Harshad number: divisible by its digit sum 27.