The number 91501
91501 is a composite number with 4 divisors. Its prime factorisation is 37 × 2473. Divisors (4): 1, 37, 2473, 91501.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91501: a semiprime: 37 × 2473, the product of two primes.
- 2
91501 is composite. Its prime factorisation is
- 3
The divisors add up to 94012; without 91501 itself that is 2511, so 91501 is deficient (2511 is less than 91501). Euler's totient φ(91501) = 88992 numbers up to 91501 share no factor with it.
- 4
The digits of 91501 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91501 = 37 \times 2473 \]
91501 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 94012 |
| Euler totient φ(n) | 88992 |
| Square | 8372433001 |
| Cube | 766085992024501 |
| Square root | 302.491322 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.1501 × |
91501 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand five hundred and one |
| Binary (base 2) | 10110010101101101 |
| Octal (base 8) | 262555 |
| Hexadecimal (base 16) | 1656D |
| Base 3 | 11122111221 |
| As time | 91501 seconds = 25 h 25 min 1 s |
Is 91501 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 1) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 91501 a prime number?
No. 91501 = 37 × 2473, so it is divisible by 37.
What are the factors of 91501?
1, 37, 2473, 91501.
What is 91501 in binary?
10110010101101101 (hexadecimal 1656D, octal 262555).
What is the square root of 91501?
About 302.4913.
Is 91501 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 91501?
91501 is a semiprime: 37 × 2473, the product of two primes.