The number 90141
90141 is a composite number with 4 divisors. Its prime factorisation is 3 × 30047. Divisors (4): 1, 3, 30047, 90141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90141: a semiprime: 3 × 30047, the product of two primes.
- 2
90141 is composite. Its prime factorisation is
- 3
The divisors add up to 120192; without 90141 itself that is 30051, so 90141 is deficient (30051 is less than 90141). Euler's totient φ(90141) = 60092 numbers up to 90141 share no factor with it.
- 4
The digits of 90141 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90141 = 3 \times 30047 \]
90141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 120192 |
| Euler totient φ(n) | 60092 |
| Square | 8125399881 |
| Cube | 732431670673221 |
| Square root | 300.234908 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 63 |
| Scientific notation | 9.0141 × |
90141 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand one hundred and forty-one |
| Binary (base 2) | 10110000000011101 |
| Octal (base 8) | 260035 |
| Hexadecimal (base 16) | 1601D |
| Base 3 | 11120122120 |
| As time | 90141 seconds = 25 h 2 min 21 s |
Is 90141 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 | Yes (90141 ÷ 3 = 30047) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 6) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90141 a prime number?
No. 90141 = 3 × 30047, so it is divisible by 3.
What are the factors of 90141?
1, 3, 30047, 90141.
What is 90141 in binary?
10110000000011101 (hexadecimal 1601D, octal 260035).
What is the square root of 90141?
About 300.2349.
Is 90141 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 90141?
90141 is a semiprime: 3 × 30047, the product of two primes.