The number 91913
91913 is a composite number with 4 divisors. Its prime factorisation is 107 × 859. Divisors (4): 1, 107, 859, 91913.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91913: a semiprime: 107 × 859, the product of two primes.
- 2
91913 is composite. Its prime factorisation is
- 3
The divisors add up to 92880; without 91913 itself that is 967, so 91913 is deficient (967 is less than 91913). Euler's totient φ(91913) = 90948 numbers up to 91913 share no factor with it.
- 4
The digits of 91913 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91913 = 107 \times 859 \]
91913 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 92880 |
| Euler totient φ(n) | 90948 |
| Square | 8447999569 |
| Cube | 776480984385497 |
| Square root | 303.171569 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.1913 × |
91913 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand nine hundred and thirteen |
| Binary (base 2) | 10110011100001001 |
| Octal (base 8) | 263411 |
| Hexadecimal (base 16) | 16709 |
| Base 3 | 11200002012 |
| As time | 91913 seconds = 25 h 31 min 53 s |
Is 91913 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 3) | 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 5) | 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 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 91913 a prime number?
No. 91913 = 107 × 859, so it is divisible by 107.
What are the factors of 91913?
1, 107, 859, 91913.
What is 91913 in binary?
10110011100001001 (hexadecimal 16709, octal 263411).
What is the square root of 91913?
About 303.1716.
Is 91913 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 91913?
91913 is a semiprime: 107 × 859, the product of two primes.