The number 92961
92961 is a composite number with 16 divisors. Its prime factorisation is × 11 × 313. Divisors (16): 1, 3, 9, 11, 27, 33, 99, 297, 313, 939, 2817, 3443, 8451, 10329, 30987, 92961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 92961: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 27.
- 2
92961 is composite. Its prime factorisation is
- 3
The divisors add up to 150720; without 92961 itself that is 57759, so 92961 is deficient (57759 is less than 92961). Euler's totient φ(92961) = 56160 numbers up to 92961 share no factor with it.
- 4
The digits of 92961 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 92961 = 3^{3} \times 11 \times 313 \]92961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 150720 |
| Euler totient φ(n) | 56160 |
| Square | 8641747521 |
| Cube | 803345491299681 |
| Square root | 304.895064 (= 3√10329) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.2961 × |
92961 in other forms
| Form | Value |
|---|---|
| In words | ninety-two thousand nine hundred and sixty-one |
| Binary (base 2) | 10110101100100001 |
| Octal (base 8) | 265441 |
| Hexadecimal (base 16) | 16B21 |
| Base 3 | 11201112000 |
| As time | 92961 seconds = 25 h 49 min 21 s |
Is 92961 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 (92961 ÷ 3 = 30987) | 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 | Yes (92961 ÷ 9 = 10329) | 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 | Yes (92961 ÷ 11 = 8451) | 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 92961 a prime number?
No. 92961 = × 11 × 313, so it is divisible by 3.
What are the factors of 92961?
1, 3, 9, 11, 27, 33, 99, 297, 313, 939, 2817, 3443, 8451, 10329, 30987, 92961.
What is 92961 in binary?
10110101100100001 (hexadecimal 16B21, octal 265441).
What is the square root of 92961?
About 304.8951, exactly 3√10329.
Is 92961 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 92961?
92961 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 27.