The number 92690
92690 is a composite number with 32 divisors. Its prime factorisation is 2 × 5 × 13 × 23 × 31. Divisors (32): 1, 2, 5, 10, 13, 23, 26, 31, 46, 62, 65, 115, 130, 155, 230, 299 … 92690.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 92690: a Harshad number: divisible by its digit sum 26.
- 2
92690 is composite. Its prime factorisation is
- 3
The divisors add up to 193536; without 92690 itself that is 100846, so 92690 is abundant (100846 is more than 92690). Euler's totient φ(92690) = 31680 numbers up to 92690 share no factor with it.
- 4
The digits of 92690 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 92690 = 2 \times 5 \times 13 \times 23 \times 31 \]
92690 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 193536 |
| Euler totient φ(n) | 31680 |
| Square | 8591436100 |
| Cube | 796340212109000 |
| Square root | 304.450324 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.269 × |
92690 in other forms
| Form | Value |
|---|---|
| In words | ninety-two thousand six hundred and ninety |
| Binary (base 2) | 10110101000010010 |
| Octal (base 8) | 265022 |
| Hexadecimal (base 16) | 16A12 |
| Base 3 | 11201010222 |
| As time | 92690 seconds = 25 h 44 min 50 s |
Is 92690 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (92690 ÷ 2 = 46345) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (92690 ÷ 5 = 18538) | 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 3) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (92690 ÷ 10 = 9269) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 92690 a prime number?
No. 92690 = 2 × 5 × 13 × 23 × 31, so it is divisible by 2.
What are the factors of 92690?
1, 2, 5, 10, 13, 23, 26, 31, 46, 62, 65, 115, 130, 155, 230, 299, 310, 403, 598, 713, 806, 1426, 1495, 2015, 2990, 3565, 4030, 7130, 9269, 18538, 46345, 92690.
What is 92690 in binary?
10110101000010010 (hexadecimal 16A12, octal 265022).
What is the square root of 92690?
About 304.4503.
Is 92690 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 92690?
92690 is a Harshad number: divisible by its digit sum 26.