The number 91013
91013 is a composite number with 4 divisors. Its prime factorisation is 13 × 7001. Divisors (4): 1, 13, 7001, 91013.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91013: a semiprime: 13 × 7001, the product of two primes.
- 2
91013 is composite. Its prime factorisation is
- 3
The divisors add up to 98028; without 91013 itself that is 7015, so 91013 is deficient (7015 is less than 91013). Euler's totient φ(91013) = 84000 numbers up to 91013 share no factor with it.
- 4
The digits of 91013 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91013 = 13 \times 7001 \]
91013 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 98028 |
| Euler totient φ(n) | 84000 |
| Square | 8283366169 |
| Cube | 753894005139197 |
| Square root | 301.683609 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.1013 × |
91013 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand and thirteen |
| Binary (base 2) | 10110001110000101 |
| Octal (base 8) | 261605 |
| Hexadecimal (base 16) | 16385 |
| Base 3 | 11121211212 |
| As time | 91013 seconds = 25 h 16 min 53 s |
Is 91013 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 6) | 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 5) | 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 10) | 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 91013 a prime number?
No. 91013 = 13 × 7001, so it is divisible by 13.
What are the factors of 91013?
1, 13, 7001, 91013.
What is 91013 in binary?
10110001110000101 (hexadecimal 16385, octal 261605).
What is the square root of 91013?
About 301.6836.
Is 91013 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 91013?
91013 is a semiprime: 13 × 7001, the product of two primes.