The number 91313
91313 is a composite number with 4 divisors. Its prime factorisation is 127 × 719. Divisors (4): 1, 127, 719, 91313.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91313: a semiprime: 127 × 719, the product of two primes.
- 2
91313 is composite. Its prime factorisation is
- 3
The divisors add up to 92160; without 91313 itself that is 847, so 91313 is deficient (847 is less than 91313). Euler's totient φ(91313) = 90468 numbers up to 91313 share no factor with it.
- 4
The digits of 91313 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 169 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91313 = 127 \times 719 \]
91313 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 92160 |
| Euler totient φ(n) | 90468 |
| Square | 8338063969 |
| Cube | 761373635201297 |
| Square root | 302.180410 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 169 |
| Scientific notation | 9.1313 × |
91313 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand three hundred and thirteen |
| Binary (base 2) | 10110010010110001 |
| Octal (base 8) | 262261 |
| Hexadecimal (base 16) | 164B1 |
| Base 3 | 11122020222 |
| As time | 91313 seconds = 25 h 21 min 53 s |
Is 91313 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 3) | 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 5) | 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 8) | 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 2) | 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 91313 a prime number?
No. 91313 = 127 × 719, so it is divisible by 127.
What are the factors of 91313?
1, 127, 719, 91313.
What is 91313 in binary?
10110010010110001 (hexadecimal 164B1, octal 262261).
What is the square root of 91313?
About 302.1804.
Is 91313 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 91313?
91313 is a semiprime: 127 × 719, the product of two primes.