The number 92948
92948 is a composite number with 12 divisors. Its prime factorisation is × 19 × 1223. Divisors (12): 1, 2, 4, 19, 38, 76, 1223, 2446, 4892, 23237, 46474, 92948.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
92948 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
92948 is composite. Its prime factorisation is
- 3
The divisors add up to 171360; without 92948 itself that is 78412, so 92948 is deficient (78412 is less than 92948). Euler's totient φ(92948) = 43992 numbers up to 92948 share no factor with it.
- 4
The digits of 92948 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 92948 = 2^{2} \times 19 \times 1223 \]92948 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 171360 |
| Euler totient φ(n) | 43992 |
| Square | 8639330704 |
| Cube | 803008510275392 |
| Square root | 304.873744 (= 2√23237) |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 53 |
| Scientific notation | 9.2948 × |
92948 in other forms
| Form | Value |
|---|---|
| In words | ninety-two thousand nine hundred and forty-eight |
| Binary (base 2) | 10110101100010100 |
| Octal (base 8) | 265424 |
| Hexadecimal (base 16) | 16B14 |
| Base 3 | 11201111112 |
| As time | 92948 seconds = 25 h 49 min 8 s |
Is 92948 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (92948 ÷ 2 = 46474) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (92948 ÷ 4 = 23237) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 92948 a prime number?
No. 92948 = × 19 × 1223, so it is divisible by 2.
What are the factors of 92948?
1, 2, 4, 19, 38, 76, 1223, 2446, 4892, 23237, 46474, 92948.
What is 92948 in binary?
10110101100010100 (hexadecimal 16B14, octal 265424).
What is the square root of 92948?
About 304.8737, exactly 2√23237.
Is 92948 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 92948?
It is a composite number with 12 divisors.