The number 90461
90461 is a composite number with 4 divisors. Its prime factorisation is 7 × 12923. Divisors (4): 1, 7, 12923, 90461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90461: a semiprime: 7 × 12923, the product of two primes.
- 2
90461 is composite. Its prime factorisation is
- 3
The divisors add up to 103392; without 90461 itself that is 12931, so 90461 is deficient (12931 is less than 90461). Euler's totient φ(90461) = 77532 numbers up to 90461 share no factor with it.
- 4
The digits of 90461 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90461 = 7 \times 12923 \]
90461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 103392 |
| Euler totient φ(n) | 77532 |
| Square | 8183192521 |
| Cube | 740259778642181 |
| Square root | 300.767352 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 115 |
| Scientific notation | 9.0461 × |
90461 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand four hundred and sixty-one |
| Binary (base 2) | 10110000101011101 |
| Octal (base 8) | 260535 |
| Hexadecimal (base 16) | 1615D |
| Base 3 | 11121002102 |
| As time | 90461 seconds = 25 h 7 min 41 s |
Is 90461 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 | Yes (90461 ÷ 7 = 12923) | 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 2) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90461 a prime number?
No. 90461 = 7 × 12923, so it is divisible by 7.
What are the factors of 90461?
1, 7, 12923, 90461.
What is 90461 in binary?
10110000101011101 (hexadecimal 1615D, octal 260535).
What is the square root of 90461?
About 300.7674.
Is 90461 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 90461?
90461 is a semiprime: 7 × 12923, the product of two primes.