The number 91981
91981 is a composite number with 4 divisors. Its prime factorisation is 59 × 1559. Divisors (4): 1, 59, 1559, 91981.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91981: a semiprime: 59 × 1559, the product of two primes.
- 2
91981 is composite. Its prime factorisation is
- 3
The divisors add up to 93600; without 91981 itself that is 1619, so 91981 is deficient (1619 is less than 91981). Euler's totient φ(91981) = 90364 numbers up to 91981 share no factor with it.
- 4
The digits of 91981 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91981 = 59 \times 1559 \]
91981 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 93600 |
| Euler totient φ(n) | 90364 |
| Square | 8460504361 |
| Cube | 778205651629141 |
| Square root | 303.283696 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.1981 × |
91981 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand nine hundred and eighty-one |
| Binary (base 2) | 10110011101001101 |
| Octal (base 8) | 263515 |
| Hexadecimal (base 16) | 1674D |
| Base 3 | 11200011201 |
| As time | 91981 seconds = 25 h 33 min 1 s |
Is 91981 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 1) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 10) | 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 91981 a prime number?
No. 91981 = 59 × 1559, so it is divisible by 59.
What are the factors of 91981?
1, 59, 1559, 91981.
What is 91981 in binary?
10110011101001101 (hexadecimal 1674D, octal 263515).
What is the square root of 91981?
About 303.2837.
Is 91981 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 91981?
91981 is a semiprime: 59 × 1559, the product of two primes.