The number 90157
90157 is a composite number with 4 divisors. Its prime factorisation is 89 × 1013. Divisors (4): 1, 89, 1013, 90157.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90157: a semiprime: 89 × 1013, the product of two primes.
- 2
90157 is composite. Its prime factorisation is
- 3
The divisors add up to 91260; without 90157 itself that is 1103, so 90157 is deficient (1103 is less than 90157). Euler's totient φ(90157) = 89056 numbers up to 90157 share no factor with it.
- 4
The digits of 90157 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90157 = 89 \times 1013 \]
90157 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 91260 |
| Euler totient φ(n) | 89056 |
| Square | 8128284649 |
| Cube | 732821759099893 |
| Square root | 300.261553 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 63 |
| Scientific notation | 9.0157 × |
90157 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand one hundred and fifty-seven |
| Binary (base 2) | 10110000000101101 |
| Octal (base 8) | 260055 |
| Hexadecimal (base 16) | 1602D |
| Base 3 | 11120200011 |
| As time | 90157 seconds = 25 h 2 min 37 s |
Is 90157 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 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 5) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90157 a prime number?
No. 90157 = 89 × 1013, so it is divisible by 89.
What are the factors of 90157?
1, 89, 1013, 90157.
What is 90157 in binary?
10110000000101101 (hexadecimal 1602D, octal 260055).
What is the square root of 90157?
About 300.2616.
Is 90157 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 90157?
90157 is a semiprime: 89 × 1013, the product of two primes.