The number 91281
91281 is a composite number with 4 divisors. Its prime factorisation is 3 × 30427. Divisors (4): 1, 3, 30427, 91281.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91281: a semiprime: 3 × 30427, the product of two primes.
- 2
91281 is composite. Its prime factorisation is
- 3
The divisors add up to 121712; without 91281 itself that is 30431, so 91281 is deficient (30431 is less than 91281). Euler's totient φ(91281) = 60852 numbers up to 91281 share no factor with it.
- 4
The digits of 91281 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91281 = 3 \times 30427 \]
91281 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 121712 |
| Euler totient φ(n) | 60852 |
| Square | 8332220961 |
| Cube | 760573461541041 |
| Square root | 302.127457 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 58 |
| Scientific notation | 9.1281 × |
91281 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand two hundred and eighty-one |
| Binary (base 2) | 10110010010010001 |
| Octal (base 8) | 262221 |
| Hexadecimal (base 16) | 16491 |
| Base 3 | 11122012210 |
| As time | 91281 seconds = 25 h 21 min 21 s |
Is 91281 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 (91281 ÷ 3 = 30427) | 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 1) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91281 a prime number?
No. 91281 = 3 × 30427, so it is divisible by 3.
What are the factors of 91281?
1, 3, 30427, 91281.
What is 91281 in binary?
10110010010010001 (hexadecimal 16491, octal 262221).
What is the square root of 91281?
About 302.1275.
Is 91281 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 91281?
91281 is a semiprime: 3 × 30427, the product of two primes.