The number 71555
71555 is a composite number with 8 divisors. Its prime factorisation is 5 × 11 × 1301. Divisors (8): 1, 5, 11, 55, 1301, 6505, 14311, 71555.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
71555 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
71555 is composite. Its prime factorisation is
- 3
The divisors add up to 93744; without 71555 itself that is 22189, so 71555 is deficient (22189 is less than 71555). Euler's totient φ(71555) = 52000 numbers up to 71555 share no factor with it.
- 4
The digits of 71555 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 125 steps to reach 1.
LaTeX source of the formulas on this page
\[ 71555 = 5 \times 11 \times 1301 \]
71555 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 93744 |
| Euler totient φ(n) | 52000 |
| Square | 5120118025 |
| Cube | 366370045278875 |
| Square root | 267.497664 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 125 |
| Scientific notation | 7.1555 × |
71555 in other forms
| Form | Value |
|---|---|
| In words | seventy-one thousand five hundred and fifty-five |
| Binary (base 2) | 10001011110000011 |
| Octal (base 8) | 213603 |
| Hexadecimal (base 16) | 11783 |
| Base 3 | 10122011012 |
| As time | 71555 seconds = 19 h 52 min 35 s |
Is 71555 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 | Yes (71555 ÷ 5 = 14311) | 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 1) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (71555 ÷ 11 = 6505) | 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 71555 a prime number?
No. 71555 = 5 × 11 × 1301, so it is divisible by 5.
What are the factors of 71555?
1, 5, 11, 55, 1301, 6505, 14311, 71555.
What is 71555 in binary?
10001011110000011 (hexadecimal 11783, octal 213603).
What is the square root of 71555?
About 267.4977.
Is 71555 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 71555?
It is a composite number with 8 divisors.