The number 61581
61581 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 1579. Divisors (8): 1, 3, 13, 39, 1579, 4737, 20527, 61581.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
61581 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
61581 is composite. Its prime factorisation is
- 3
The divisors add up to 88480; without 61581 itself that is 26899, so 61581 is deficient (26899 is less than 61581). Euler's totient φ(61581) = 37872 numbers up to 61581 share no factor with it.
- 4
The digits of 61581 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61581 = 3 \times 13 \times 1579 \]
61581 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 88480 |
| Euler totient φ(n) | 37872 |
| Square | 3792219561 |
| Cube | 233528672785941 |
| Square root | 248.155193 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.1581 × |
61581 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand five hundred and eighty-one |
| Binary (base 2) | 1111000010001101 |
| Octal (base 8) | 170215 |
| Hexadecimal (base 16) | F08D |
| Base 3 | 10010110210 |
| As time | 61581 seconds = 17 h 6 min 21 s |
Is 61581 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 (61581 ÷ 3 = 20527) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61581 a prime number?
No. 61581 = 3 × 13 × 1579, so it is divisible by 3.
What are the factors of 61581?
1, 3, 13, 39, 1579, 4737, 20527, 61581.
What is 61581 in binary?
1111000010001101 (hexadecimal F08D, octal 170215).
What is the square root of 61581?
About 248.1552.
Is 61581 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 61581?
It is a composite number with 8 divisors.