The number 91561
91561 is a composite number with 8 divisors. Its prime factorisation is 19 × 61 × 79. Divisors (8): 1, 19, 61, 79, 1159, 1501, 4819, 91561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91561 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91561 is composite. Its prime factorisation is
- 3
The divisors add up to 99200; without 91561 itself that is 7639, so 91561 is deficient (7639 is less than 91561). Euler's totient φ(91561) = 84240 numbers up to 91561 share no factor with it.
- 4
The digits of 91561 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91561 = 19 \times 61 \times 79 \]
91561 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 99200 |
| Euler totient φ(n) | 84240 |
| Square | 8383416721 |
| Cube | 767594018391481 |
| Square root | 302.590482 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 115 |
| Scientific notation | 9.1561 × |
91561 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand five hundred and sixty-one |
| Binary (base 2) | 10110010110101001 |
| Octal (base 8) | 262651 |
| Hexadecimal (base 16) | 165A9 |
| Base 3 | 11122121011 |
| As time | 91561 seconds = 25 h 26 min 1 s |
Is 91561 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 1) | 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 4) | 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 8) | 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 91561 a prime number?
No. 91561 = 19 × 61 × 79, so it is divisible by 19.
What are the factors of 91561?
1, 19, 61, 79, 1159, 1501, 4819, 91561.
What is 91561 in binary?
10110010110101001 (hexadecimal 165A9, octal 262651).
What is the square root of 91561?
About 302.5905.
Is 91561 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 91561?
It is a composite number with 8 divisors.