The number 71561
71561 is a composite number with 4 divisors. Its prime factorisation is 7 × 10223. Divisors (4): 1, 7, 10223, 71561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 71561: a semiprime: 7 × 10223, the product of two primes.
- 2
71561 is composite. Its prime factorisation is
- 3
The divisors add up to 81792; without 71561 itself that is 10231, so 71561 is deficient (10231 is less than 71561). Euler's totient φ(71561) = 61332 numbers up to 71561 share no factor with it.
- 4
The digits of 71561 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 125 steps to reach 1.
LaTeX source of the formulas on this page
\[ 71561 = 7 \times 10223 \]
71561 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 81792 |
| Euler totient φ(n) | 61332 |
| Square | 5120976721 |
| Cube | 366462215131481 |
| Square root | 267.508878 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 125 |
| Scientific notation | 7.1561 × |
71561 in other forms
| Form | Value |
|---|---|
| In words | seventy-one thousand five hundred and sixty-one |
| Binary (base 2) | 10001011110001001 |
| Octal (base 8) | 213611 |
| Hexadecimal (base 16) | 11789 |
| Base 3 | 10122011102 |
| As time | 71561 seconds = 19 h 52 min 41 s |
Is 71561 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 1) | 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 | Yes (71561 ÷ 7 = 10223) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 71561 a prime number?
No. 71561 = 7 × 10223, so it is divisible by 7.
What are the factors of 71561?
1, 7, 10223, 71561.
What is 71561 in binary?
10001011110001001 (hexadecimal 11789, octal 213611).
What is the square root of 71561?
About 267.5089.
Is 71561 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 71561?
71561 is a semiprime: 7 × 10223, the product of two primes.