The number 81263
81263 is a composite number with 16 divisors. Its prime factorisation is 7 × 13 × 19 × 47. Divisors (16): 1, 7, 13, 19, 47, 91, 133, 247, 329, 611, 893, 1729, 4277, 6251, 11609, 81263.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
81263 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
81263 is composite. Its prime factorisation is
- 3
The divisors add up to 107520; without 81263 itself that is 26257, so 81263 is deficient (26257 is less than 81263). Euler's totient φ(81263) = 59616 numbers up to 81263 share no factor with it.
- 4
The digits of 81263 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 94 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81263 = 7 \times 13 \times 19 \times 47 \]
81263 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 107520 |
| Euler totient φ(n) | 59616 |
| Square | 6603675169 |
| Cube | 536634455258447 |
| Square root | 285.066659 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 94 |
| Scientific notation | 8.1263 × |
81263 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand two hundred and sixty-three |
| Binary (base 2) | 10011110101101111 |
| Octal (base 8) | 236557 |
| Hexadecimal (base 16) | 13D6F |
| Base 3 | 11010110202 |
| As time | 81263 seconds = 22 h 34 min 23 s |
Is 81263 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 3) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (81263 ÷ 7 = 11609) | 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 | No (remainder 2) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81263 a prime number?
No. 81263 = 7 × 13 × 19 × 47, so it is divisible by 7.
What are the factors of 81263?
1, 7, 13, 19, 47, 91, 133, 247, 329, 611, 893, 1729, 4277, 6251, 11609, 81263.
What is 81263 in binary?
10011110101101111 (hexadecimal 13D6F, octal 236557).
What is the square root of 81263?
About 285.0667.
Is 81263 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 81263?
It is a composite number with 16 divisors.