The number 92946
92946 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 7 × 2213. Divisors (16): 1, 2, 3, 6, 7, 14, 21, 42, 2213, 4426, 6639, 13278, 15491, 30982, 46473, 92946.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
92946 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
92946 is composite. Its prime factorisation is
- 3
The divisors add up to 212544; without 92946 itself that is 119598, so 92946 is abundant (119598 is more than 92946). Euler's totient φ(92946) = 26544 numbers up to 92946 share no factor with it.
- 4
The digits of 92946 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
\[ 92946 = 2 \times 3 \times 7 \times 2213 \]
92946 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 212544 |
| Euler totient φ(n) | 26544 |
| Square | 8638958916 |
| Cube | 802956675406536 |
| Square root | 304.870464 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 115 |
| Scientific notation | 9.2946 × |
92946 in other forms
| Form | Value |
|---|---|
| In words | ninety-two thousand nine hundred and forty-six |
| Binary (base 2) | 10110101100010010 |
| Octal (base 8) | 265422 |
| Hexadecimal (base 16) | 16B12 |
| Base 3 | 11201111110 |
| As time | 92946 seconds = 25 h 49 min 6 s |
Is 92946 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (92946 ÷ 2 = 46473) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (92946 ÷ 3 = 30982) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (92946 ÷ 6 = 15491) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (92946 ÷ 7 = 13278) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 92946 a prime number?
No. 92946 = 2 × 3 × 7 × 2213, so it is divisible by 2.
What are the factors of 92946?
1, 2, 3, 6, 7, 14, 21, 42, 2213, 4426, 6639, 13278, 15491, 30982, 46473, 92946.
What is 92946 in binary?
10110101100010010 (hexadecimal 16B12, octal 265422).
What is the square root of 92946?
About 304.8705.
Is 92946 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 92946?
It is a composite number with 16 divisors.