The number 92938
92938 is a composite number with 8 divisors. Its prime factorisation is 2 × 31 × 1499. Divisors (8): 1, 2, 31, 62, 1499, 2998, 46469, 92938.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 92938: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 31.
- 2
92938 is composite. Its prime factorisation is
- 3
The divisors add up to 144000; without 92938 itself that is 51062, so 92938 is deficient (51062 is less than 92938). Euler's totient φ(92938) = 44940 numbers up to 92938 share no factor with it.
- 4
The digits of 92938 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 92938 = 2 \times 31 \times 1499 \]
92938 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 144000 |
| Euler totient φ(n) | 44940 |
| Square | 8637471844 |
| Cube | 802749358237672 |
| Square root | 304.857344 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.2938 × |
92938 in other forms
| Form | Value |
|---|---|
| In words | ninety-two thousand nine hundred and thirty-eight |
| Binary (base 2) | 10110101100001010 |
| Octal (base 8) | 265412 |
| Hexadecimal (base 16) | 16B0A |
| Base 3 | 11201111011 |
| As time | 92938 seconds = 25 h 48 min 58 s |
Is 92938 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (92938 ÷ 2 = 46469) | 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 3) | 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 6) | 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 4) | 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 10) | 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 92938 a prime number?
No. 92938 = 2 × 31 × 1499, so it is divisible by 2.
What are the factors of 92938?
1, 2, 31, 62, 1499, 2998, 46469, 92938.
What is 92938 in binary?
10110101100001010 (hexadecimal 16B0A, octal 265412).
What is the square root of 92938?
About 304.8573.
Is 92938 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 92938?
92938 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 31.