The number 90497
90497 is a composite number with 8 divisors. Its prime factorisation is 11 × 19 × 433. Divisors (8): 1, 11, 19, 209, 433, 4763, 8227, 90497.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
90497 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
90497 is composite. Its prime factorisation is
- 3
The divisors add up to 104160; without 90497 itself that is 13663, so 90497 is deficient (13663 is less than 90497). Euler's totient φ(90497) = 77760 numbers up to 90497 share no factor with it.
- 4
The digits of 90497 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90497 = 11 \times 19 \times 433 \]
90497 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 104160 |
| Euler totient φ(n) | 77760 |
| Square | 8189707009 |
| Cube | 741143915193473 |
| Square root | 300.827193 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 89 |
| Scientific notation | 9.0497 × |
90497 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand four hundred and ninety-seven |
| Binary (base 2) | 10110000110000001 |
| Octal (base 8) | 260601 |
| Hexadecimal (base 16) | 16181 |
| Base 3 | 11121010202 |
| As time | 90497 seconds = 25 h 8 min 17 s |
Is 90497 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 2) | 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 1) | 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 1) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (90497 ÷ 11 = 8227) | 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 90497 a prime number?
No. 90497 = 11 × 19 × 433, so it is divisible by 11.
What are the factors of 90497?
1, 11, 19, 209, 433, 4763, 8227, 90497.
What is 90497 in binary?
10110000110000001 (hexadecimal 16181, octal 260601).
What is the square root of 90497?
About 300.8272.
Is 90497 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 90497?
It is a composite number with 8 divisors.