The number 92962
92962 is a composite number with 8 divisors. Its prime factorisation is 2 × 53 × 877. Divisors (8): 1, 2, 53, 106, 877, 1754, 46481, 92962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
92962 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
92962 is composite. Its prime factorisation is
- 3
The divisors add up to 142236; without 92962 itself that is 49274, so 92962 is deficient (49274 is less than 92962). Euler's totient φ(92962) = 45552 numbers up to 92962 share no factor with it.
- 4
The digits of 92962 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 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 92962 = 2 \times 53 \times 877 \]
92962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 142236 |
| Euler totient φ(n) | 45552 |
| Square | 8641933444 |
| Cube | 803371416821128 |
| Square root | 304.896704 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.2962 × |
92962 in other forms
| Form | Value |
|---|---|
| In words | ninety-two thousand nine hundred and sixty-two |
| Binary (base 2) | 10110101100100010 |
| Octal (base 8) | 265442 |
| Hexadecimal (base 16) | 16B22 |
| Base 3 | 11201112001 |
| As time | 92962 seconds = 25 h 49 min 22 s |
Is 92962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (92962 ÷ 2 = 46481) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 2) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 92962 a prime number?
No. 92962 = 2 × 53 × 877, so it is divisible by 2.
What are the factors of 92962?
1, 2, 53, 106, 877, 1754, 46481, 92962.
What is 92962 in binary?
10110101100100010 (hexadecimal 16B22, octal 265442).
What is the square root of 92962?
About 304.8967.
Is 92962 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 92962?
It is a composite number with 8 divisors.