The number 81581
81581 is a composite number with 4 divisors. Its prime factorisation is 23 × 3547. Divisors (4): 1, 23, 3547, 81581.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 81581: a Harshad number: divisible by its digit sum 23; a semiprime: 23 × 3547, the product of two primes.
- 2
81581 is composite. Its prime factorisation is
- 3
The divisors add up to 85152; without 81581 itself that is 3571, so 81581 is deficient (3571 is less than 81581). Euler's totient φ(81581) = 78012 numbers up to 81581 share no factor with it.
- 4
The digits of 81581 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 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81581 = 23 \times 3547 \]
81581 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 85152 |
| Euler totient φ(n) | 78012 |
| Square | 6655459561 |
| Cube | 542959046445941 |
| Square root | 285.623879 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 89 |
| Scientific notation | 8.1581 × |
81581 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand five hundred and eighty-one |
| Binary (base 2) | 10011111010101101 |
| Octal (base 8) | 237255 |
| Hexadecimal (base 16) | 13EAD |
| Base 3 | 11010220112 |
| As time | 81581 seconds = 22 h 39 min 41 s |
Is 81581 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 | No (remainder 3) | 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 5) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81581 a prime number?
No. 81581 = 23 × 3547, so it is divisible by 23.
What are the factors of 81581?
1, 23, 3547, 81581.
What is 81581 in binary?
10011111010101101 (hexadecimal 13EAD, octal 237255).
What is the square root of 81581?
About 285.6239.
Is 81581 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 81581?
81581 is a Harshad number: divisible by its digit sum 23; a semiprime: 23 × 3547, the product of two primes.