The number 90341
90341 is a composite number with 4 divisors. Its prime factorisation is 61 × 1481. Divisors (4): 1, 61, 1481, 90341.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90341: a semiprime: 61 × 1481, the product of two primes.
- 2
90341 is composite. Its prime factorisation is
- 3
The divisors add up to 91884; without 90341 itself that is 1543, so 90341 is deficient (1543 is less than 90341). Euler's totient φ(90341) = 88800 numbers up to 90341 share no factor with it.
- 4
The digits of 90341 add up to 17, 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
\[ 90341 = 61 \times 1481 \]
90341 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 91884 |
| Euler totient φ(n) | 88800 |
| Square | 8161496281 |
| Cube | 737317735521821 |
| Square root | 300.567796 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 89 |
| Scientific notation | 9.0341 × |
90341 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand three hundred and forty-one |
| Binary (base 2) | 10110000011100101 |
| Octal (base 8) | 260345 |
| Hexadecimal (base 16) | 160E5 |
| Base 3 | 11120220222 |
| As time | 90341 seconds = 25 h 5 min 41 s |
Is 90341 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 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 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 5) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90341 a prime number?
No. 90341 = 61 × 1481, so it is divisible by 61.
What are the factors of 90341?
1, 61, 1481, 90341.
What is 90341 in binary?
10110000011100101 (hexadecimal 160E5, octal 260345).
What is the square root of 90341?
About 300.5678.
Is 90341 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 90341?
90341 is a semiprime: 61 × 1481, the product of two primes.