The number 91513
91513 is the 8849th prime number. Its only divisors are 1 and 91513.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91513: the 8849th prime number.
- 2
91513 is prime, so its only factors are 1 and 91513. It is the 8849th prime; the next prime is 91529 and the one before is 91499.
- 3
The divisors add up to 91514; without 91513 itself that is 1, so 91513 is deficient (1 is less than 91513). Euler's totient φ(91513) = 91512 numbers up to 91513 share no factor with it.
- 4
The digits of 91513 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
91513 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 91514 |
| Euler totient φ(n) | 91512 |
| Square | 8374629169 |
| Cube | 766387439142697 |
| Square root | 302.511157 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.1513 × |
91513 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand five hundred and thirteen |
| Binary (base 2) | 10110010101111001 |
| Octal (base 8) | 262571 |
| Hexadecimal (base 16) | 16579 |
| Base 3 | 11122112101 |
| As time | 91513 seconds = 25 h 25 min 13 s |
Is 91513 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 2) | 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 1) | 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 4) | 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 91513 a prime number?
Yes. 91513 is divisible only by 1 and itself.
What are the factors of 91513?
1, 91513.
What is 91513 in binary?
10110010101111001 (hexadecimal 16579, octal 262571).
What is the square root of 91513?
About 302.5112.
Is 91513 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 91513?
91513 is the 8849th prime number.