The number 81913
81913 is a binary palindrome (10011111111111001). Its prime factorisation is 13 × 6301. Divisors (4): 1, 13, 6301, 81913.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 81913: a binary palindrome (10011111111111001); a semiprime: 13 × 6301, the product of two primes.
- 2
81913 is composite. Its prime factorisation is
- 3
The divisors add up to 88228; without 81913 itself that is 6315, so 81913 is deficient (6315 is less than 81913). Euler's totient φ(81913) = 75600 numbers up to 81913 share no factor with it.
- 4
The digits of 81913 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 182 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81913 = 13 \times 6301 \]
81913 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 88228 |
| Euler totient φ(n) | 75600 |
| Square | 6709739569 |
| Cube | 549614897315497 |
| Square root | 286.204472 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 182 |
| Scientific notation | 8.1913 × |
81913 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand nine hundred and thirteen |
| Binary (base 2) | 10011111111111001 |
| Octal (base 8) | 237771 |
| Hexadecimal (base 16) | 13FF9 |
| Base 3 | 11011100211 |
| As time | 81913 seconds = 22 h 45 min 13 s |
Is 81913 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 1) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81913 a prime number?
No. 81913 = 13 × 6301, so it is divisible by 13.
What are the factors of 81913?
1, 13, 6301, 81913.
What is 81913 in binary?
10011111111111001 (hexadecimal 13FF9, octal 237771).
What is the square root of 81913?
About 286.2045.
Is 81913 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 81913?
81913 is a binary palindrome (10011111111111001); a semiprime: 13 × 6301, the product of two primes.