The number 91461
91461 is a composite number with 8 divisors. Its prime factorisation is 3 × 43 × 709. Divisors (8): 1, 3, 43, 129, 709, 2127, 30487, 91461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91461 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91461 is composite. Its prime factorisation is
- 3
The divisors add up to 124960; without 91461 itself that is 33499, so 91461 is deficient (33499 is less than 91461). Euler's totient φ(91461) = 59472 numbers up to 91461 share no factor with it.
- 4
The digits of 91461 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91461 = 3 \times 43 \times 709 \]
91461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 124960 |
| Euler totient φ(n) | 59472 |
| Square | 8365114521 |
| Cube | 765081739205181 |
| Square root | 302.425197 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 133 |
| Scientific notation | 9.1461 × |
91461 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand four hundred and sixty-one |
| Binary (base 2) | 10110010101000101 |
| Octal (base 8) | 262505 |
| Hexadecimal (base 16) | 16545 |
| Base 3 | 11122110110 |
| As time | 91461 seconds = 25 h 24 min 21 s |
Is 91461 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 | Yes (91461 ÷ 3 = 30487) | 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 3) | 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 3) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91461 a prime number?
No. 91461 = 3 × 43 × 709, so it is divisible by 3.
What are the factors of 91461?
1, 3, 43, 129, 709, 2127, 30487, 91461.
What is 91461 in binary?
10110010101000101 (hexadecimal 16545, octal 262505).
What is the square root of 91461?
About 302.4252.
Is 91461 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 91461?
It is a composite number with 8 divisors.