The number 90791
90791 is a composite number with 4 divisors. Its prime factorisation is 163 × 557. Divisors (4): 1, 163, 557, 90791.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90791: a semiprime: 163 × 557, the product of two primes.
- 2
90791 is composite. Its prime factorisation is
- 3
The divisors add up to 91512; without 90791 itself that is 721, so 90791 is deficient (721 is less than 90791). Euler's totient φ(90791) = 90072 numbers up to 90791 share no factor with it.
- 4
The digits of 90791 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 164 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90791 = 163 \times 557 \]
90791 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 91512 |
| Euler totient φ(n) | 90072 |
| Square | 8243005681 |
| Cube | 748390728783671 |
| Square root | 301.315449 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 164 |
| Scientific notation | 9.0791 × |
90791 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand seven hundred and ninety-one |
| Binary (base 2) | 10110001010100111 |
| Octal (base 8) | 261247 |
| Hexadecimal (base 16) | 162A7 |
| Base 3 | 11121112122 |
| As time | 90791 seconds = 25 h 13 min 11 s |
Is 90791 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 3) | 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 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 7) | 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 1) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90791 a prime number?
No. 90791 = 163 × 557, so it is divisible by 163.
What are the factors of 90791?
1, 163, 557, 90791.
What is 90791 in binary?
10110001010100111 (hexadecimal 162A7, octal 261247).
What is the square root of 90791?
About 301.3154.
Is 90791 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 90791?
90791 is a semiprime: 163 × 557, the product of two primes.