The number 81508
81508 is a composite number with 24 divisors. Its prime factorisation is × 7 × 41 × 71. Divisors (24): 1, 2, 4, 7, 14, 28, 41, 71, 82, 142, 164, 284, 287, 497, 574, 994 … 81508.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
81508 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
81508 is composite. Its prime factorisation is
- 3
The divisors add up to 169344; without 81508 itself that is 87836, so 81508 is abundant (87836 is more than 81508). Euler's totient φ(81508) = 33600 numbers up to 81508 share no factor with it.
- 4
The digits of 81508 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 37 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81508 = 2^{2} \times 7 \times 41 \times 71 \]81508 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 169344 |
| Euler totient φ(n) | 33600 |
| Square | 6643554064 |
| Cube | 541502804648512 |
| Square root | 285.496060 (= 2√20377) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 37 |
| Scientific notation | 8.1508 × |
81508 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand five hundred and eight |
| Binary (base 2) | 10011111001100100 |
| Octal (base 8) | 237144 |
| Hexadecimal (base 16) | 13E64 |
| Base 3 | 11010210211 |
| As time | 81508 seconds = 22 h 38 min 28 s |
Is 81508 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (81508 ÷ 2 = 40754) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (81508 ÷ 4 = 20377) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (81508 ÷ 7 = 11644) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81508 a prime number?
No. 81508 = × 7 × 41 × 71, so it is divisible by 2.
What are the factors of 81508?
1, 2, 4, 7, 14, 28, 41, 71, 82, 142, 164, 284, 287, 497, 574, 994, 1148, 1988, 2911, 5822, 11644, 20377, 40754, 81508.
What is 81508 in binary?
10011111001100100 (hexadecimal 13E64, octal 237144).
What is the square root of 81508?
About 285.4961, exactly 2√20377.
Is 81508 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 81508?
It is a composite number with 24 divisors.