The number 55071
55071 is a composite number with 12 divisors. Its prime factorisation is × 29 × 211. Divisors (12): 1, 3, 9, 29, 87, 211, 261, 633, 1899, 6119, 18357, 55071.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55071: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
55071 is composite. Its prime factorisation is
- 3
The divisors add up to 82680; without 55071 itself that is 27609, so 55071 is deficient (27609 is less than 55071). Euler's totient φ(55071) = 35280 numbers up to 55071 share no factor with it.
- 4
The digits of 55071 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 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55071 = 3^{2} \times 29 \times 211 \]55071 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 82680 |
| Euler totient φ(n) | 35280 |
| Square | 3032815041 |
| Cube | 167020157122911 |
| Square root | 234.672112 (= 3√6119) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.5071 × |
55071 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand and seventy-one |
| Binary (base 2) | 1101011100011111 |
| Octal (base 8) | 153437 |
| Hexadecimal (base 16) | D71F |
| Base 3 | 2210112200 |
| As time | 55071 seconds = 15 h 17 min 51 s |
Is 55071 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 (55071 ÷ 3 = 18357) | 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 2) | 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 | Yes (55071 ÷ 9 = 6119) | 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 5) | 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 55071 a prime number?
No. 55071 = × 29 × 211, so it is divisible by 3.
What are the factors of 55071?
1, 3, 9, 29, 87, 211, 261, 633, 1899, 6119, 18357, 55071.
What is 55071 in binary?
1101011100011111 (hexadecimal D71F, octal 153437).
What is the square root of 55071?
About 234.6721, exactly 3√6119.
Is 55071 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 55071?
55071 is a happy number: repeatedly adding the squares of its digits reaches 1.