The number 81497
81497 is a composite number with 4 divisors. Its prime factorisation is 13 × 6269. Divisors (4): 1, 13, 6269, 81497.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 81497: a semiprime: 13 × 6269, the product of two primes.
- 2
81497 is composite. Its prime factorisation is
- 3
The divisors add up to 87780; without 81497 itself that is 6283, so 81497 is deficient (6283 is less than 81497). Euler's totient φ(81497) = 75216 numbers up to 81497 share no factor with it.
- 4
The digits of 81497 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81497 = 13 \times 6269 \]
81497 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 87780 |
| Euler totient φ(n) | 75216 |
| Square | 6641761009 |
| Cube | 541283596950473 |
| Square root | 285.476794 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 151 |
| Scientific notation | 8.1497 × |
81497 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand four hundred and ninety-seven |
| Binary (base 2) | 10011111001011001 |
| Octal (base 8) | 237131 |
| Hexadecimal (base 16) | 13E59 |
| Base 3 | 11010210102 |
| As time | 81497 seconds = 22 h 38 min 17 s |
Is 81497 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 2) | 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 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 7) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81497 a prime number?
No. 81497 = 13 × 6269, so it is divisible by 13.
What are the factors of 81497?
1, 13, 6269, 81497.
What is 81497 in binary?
10011111001011001 (hexadecimal 13E59, octal 237131).
What is the square root of 81497?
About 285.4768.
Is 81497 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 81497?
81497 is a semiprime: 13 × 6269, the product of two primes.