The number 81495
81495 is a composite number with 12 divisors. Its prime factorisation is × 5 × 1811. Divisors (12): 1, 3, 5, 9, 15, 45, 1811, 5433, 9055, 16299, 27165, 81495.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
81495 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
81495 is composite. Its prime factorisation is
- 3
The divisors add up to 141336; without 81495 itself that is 59841, so 81495 is deficient (59841 is less than 81495). Euler's totient φ(81495) = 43440 numbers up to 81495 share no factor with it.
- 4
The digits of 81495 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 37 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81495 = 3^{2} \times 5 \times 1811 \]81495 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 141336 |
| Euler totient φ(n) | 43440 |
| Square | 6641435025 |
| Cube | 541243747362375 |
| Square root | 285.473291 (= 3√9055) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 37 |
| Scientific notation | 8.1495 × |
81495 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand four hundred and ninety-five |
| Binary (base 2) | 10011111001010111 |
| Octal (base 8) | 237127 |
| Hexadecimal (base 16) | 13E57 |
| Base 3 | 11010210100 |
| As time | 81495 seconds = 22 h 38 min 15 s |
Is 81495 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 (81495 ÷ 3 = 27165) | 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 (81495 ÷ 5 = 16299) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (81495 ÷ 9 = 9055) | 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 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81495 a prime number?
No. 81495 = × 5 × 1811, so it is divisible by 3.
What are the factors of 81495?
1, 3, 5, 9, 15, 45, 1811, 5433, 9055, 16299, 27165, 81495.
What is 81495 in binary?
10011111001010111 (hexadecimal 13E57, octal 237127).
What is the square root of 81495?
About 285.4733, exactly 3√9055.
Is 81495 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 81495?
It is a composite number with 12 divisors.