The number 92991
92991 is a composite number with 8 divisors. Its prime factorisation is 3 × 139 × 223. Divisors (8): 1, 3, 139, 223, 417, 669, 30997, 92991.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
92991 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
92991 is composite. Its prime factorisation is
- 3
The divisors add up to 125440; without 92991 itself that is 32449, so 92991 is deficient (32449 is less than 92991). Euler's totient φ(92991) = 61272 numbers up to 92991 share no factor with it.
- 4
The digits of 92991 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 92991 = 3 \times 139 \times 223 \]
92991 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 125440 |
| Euler totient φ(n) | 61272 |
| Square | 8647326081 |
| Cube | 804123499598271 |
| Square root | 304.944257 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 115 |
| Scientific notation | 9.2991 × |
92991 in other forms
| Form | Value |
|---|---|
| In words | ninety-two thousand nine hundred and ninety-one |
| Binary (base 2) | 10110101100111111 |
| Octal (base 8) | 265477 |
| Hexadecimal (base 16) | 16B3F |
| Base 3 | 11201120010 |
| As time | 92991 seconds = 25 h 49 min 51 s |
Is 92991 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 (92991 ÷ 3 = 30997) | 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 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 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 7) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 92991 a prime number?
No. 92991 = 3 × 139 × 223, so it is divisible by 3.
What are the factors of 92991?
1, 3, 139, 223, 417, 669, 30997, 92991.
What is 92991 in binary?
10110101100111111 (hexadecimal 16B3F, octal 265477).
What is the square root of 92991?
About 304.9443.
Is 92991 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 92991?
It is a composite number with 8 divisors.