The number 90692
90692 is a composite number with 24 divisors. Its prime factorisation is × 7 × 41 × 79. Divisors (24): 1, 2, 4, 7, 14, 28, 41, 79, 82, 158, 164, 287, 316, 553, 574, 1106 … 90692.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
90692 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
90692 is composite. Its prime factorisation is
- 3
The divisors add up to 188160; without 90692 itself that is 97468, so 90692 is abundant (97468 is more than 90692). Euler's totient φ(90692) = 37440 numbers up to 90692 share no factor with it.
- 4
The digits of 90692 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 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90692 = 2^{2} \times 7 \times 41 \times 79 \]90692 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 188160 |
| Euler totient φ(n) | 37440 |
| Square | 8225038864 |
| Cube | 745945224653888 |
| Square root | 301.151125 (= 2√22673) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 89 |
| Scientific notation | 9.0692 × |
90692 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand six hundred and ninety-two |
| Binary (base 2) | 10110001001000100 |
| Octal (base 8) | 261104 |
| Hexadecimal (base 16) | 16244 |
| Base 3 | 11121101222 |
| As time | 90692 seconds = 25 h 11 min 32 s |
Is 90692 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (90692 ÷ 2 = 45346) | 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 (90692 ÷ 4 = 22673) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (90692 ÷ 7 = 12956) | 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 8) | 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 8) | 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 90692 a prime number?
No. 90692 = × 7 × 41 × 79, so it is divisible by 2.
What are the factors of 90692?
1, 2, 4, 7, 14, 28, 41, 79, 82, 158, 164, 287, 316, 553, 574, 1106, 1148, 2212, 3239, 6478, 12956, 22673, 45346, 90692.
What is 90692 in binary?
10110001001000100 (hexadecimal 16244, octal 261104).
What is the square root of 90692?
About 301.1511, exactly 2√22673.
Is 90692 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 90692?
It is a composite number with 24 divisors.