The number 90493
90493 is a composite number with 4 divisors. Its prime factorisation is 13 × 6961. Divisors (4): 1, 13, 6961, 90493.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90493: a semiprime: 13 × 6961, the product of two primes.
- 2
90493 is composite. Its prime factorisation is
- 3
The divisors add up to 97468; without 90493 itself that is 6975, so 90493 is deficient (6975 is less than 90493). Euler's totient φ(90493) = 83520 numbers up to 90493 share no factor with it.
- 4
The digits of 90493 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90493 = 13 \times 6961 \]
90493 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 97468 |
| Euler totient φ(n) | 83520 |
| Square | 8188983049 |
| Cube | 741045643053157 |
| Square root | 300.820545 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 89 |
| Scientific notation | 9.0493 × |
90493 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand four hundred and ninety-three |
| Binary (base 2) | 10110000101111101 |
| Octal (base 8) | 260575 |
| Hexadecimal (base 16) | 1617D |
| Base 3 | 11121010121 |
| As time | 90493 seconds = 25 h 8 min 13 s |
Is 90493 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 3) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90493 a prime number?
No. 90493 = 13 × 6961, so it is divisible by 13.
What are the factors of 90493?
1, 13, 6961, 90493.
What is 90493 in binary?
10110000101111101 (hexadecimal 1617D, octal 260575).
What is the square root of 90493?
About 300.8205.
Is 90493 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 90493?
90493 is a semiprime: 13 × 6961, the product of two primes.