The number 90131
90131 is a composite number with 4 divisors. Its prime factorisation is 193 × 467. Divisors (4): 1, 193, 467, 90131.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90131: a semiprime: 193 × 467, the product of two primes.
- 2
90131 is composite. Its prime factorisation is
- 3
The divisors add up to 90792; without 90131 itself that is 661, so 90131 is deficient (661 is less than 90131). Euler's totient φ(90131) = 89472 numbers up to 90131 share no factor with it.
- 4
The digits of 90131 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90131 = 193 \times 467 \]
90131 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 90792 |
| Euler totient φ(n) | 89472 |
| Square | 8123597161 |
| Cube | 732187935718091 |
| Square root | 300.218254 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 133 |
| Scientific notation | 9.0131 × |
90131 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand one hundred and thirty-one |
| Binary (base 2) | 10110000000010011 |
| Octal (base 8) | 260023 |
| Hexadecimal (base 16) | 16013 |
| Base 3 | 11120122012 |
| As time | 90131 seconds = 25 h 2 min 11 s |
Is 90131 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 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 3) | 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 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 90131 a prime number?
No. 90131 = 193 × 467, so it is divisible by 193.
What are the factors of 90131?
1, 193, 467, 90131.
What is 90131 in binary?
10110000000010011 (hexadecimal 16013, octal 260023).
What is the square root of 90131?
About 300.2183.
Is 90131 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 90131?
90131 is a semiprime: 193 × 467, the product of two primes.