The number 90913
90913 is a composite number with 4 divisors. Its prime factorisation is 229 × 397. Divisors (4): 1, 229, 397, 90913.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90913: a semiprime: 229 × 397, the product of two primes.
- 2
90913 is composite. Its prime factorisation is
- 3
The divisors add up to 91540; without 90913 itself that is 627, so 90913 is deficient (627 is less than 90913). Euler's totient φ(90913) = 90288 numbers up to 90913 share no factor with it.
- 4
The digits of 90913 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 208 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90913 = 229 \times 397 \]
90913 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 91540 |
| Euler totient φ(n) | 90288 |
| Square | 8265173569 |
| Cube | 751411724678497 |
| Square root | 301.517827 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 208 |
| Scientific notation | 9.0913 × |
90913 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand nine hundred and thirteen |
| Binary (base 2) | 10110001100100001 |
| Octal (base 8) | 261441 |
| Hexadecimal (base 16) | 16321 |
| Base 3 | 11121201011 |
| As time | 90913 seconds = 25 h 15 min 13 s |
Is 90913 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 9) | 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 90913 a prime number?
No. 90913 = 229 × 397, so it is divisible by 229.
What are the factors of 90913?
1, 229, 397, 90913.
What is 90913 in binary?
10110001100100001 (hexadecimal 16321, octal 261441).
What is the square root of 90913?
About 301.5178.
Is 90913 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 90913?
90913 is a semiprime: 229 × 397, the product of two primes.