The number 91531
91531 is a composite number with 8 divisors. Its prime factorisation is 11 × 53 × 157. Divisors (8): 1, 11, 53, 157, 583, 1727, 8321, 91531.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91531 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91531 is composite. Its prime factorisation is
- 3
The divisors add up to 102384; without 91531 itself that is 10853, so 91531 is deficient (10853 is less than 91531). Euler's totient φ(91531) = 81120 numbers up to 91531 share no factor with it.
- 4
The digits of 91531 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.
LaTeX source of the formulas on this page
\[ 91531 = 11 \times 53 \times 157 \]
91531 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 102384 |
| Euler totient φ(n) | 81120 |
| Square | 8377923961 |
| Cube | 766839758074291 |
| Square root | 302.540906 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.1531 × |
91531 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand five hundred and thirty-one |
| Binary (base 2) | 10110010110001011 |
| Octal (base 8) | 262613 |
| Hexadecimal (base 16) | 1658B |
| Base 3 | 11122120001 |
| As time | 91531 seconds = 25 h 25 min 31 s |
Is 91531 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 3) | 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 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 3) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (91531 ÷ 11 = 8321) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91531 a prime number?
No. 91531 = 11 × 53 × 157, so it is divisible by 11.
What are the factors of 91531?
1, 11, 53, 157, 583, 1727, 8321, 91531.
What is 91531 in binary?
10110010110001011 (hexadecimal 1658B, octal 262613).
What is the square root of 91531?
About 302.5409.
Is 91531 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 91531?
It is a composite number with 8 divisors.