The number 91481
91481 is a composite number with 8 divisors. Its prime factorisation is 13 × 31 × 227. Divisors (8): 1, 13, 31, 227, 403, 2951, 7037, 91481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91481 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91481 is composite. Its prime factorisation is
- 3
The divisors add up to 102144; without 91481 itself that is 10663, so 91481 is deficient (10663 is less than 91481). Euler's totient φ(91481) = 81360 numbers up to 91481 share no factor with it.
- 4
The digits of 91481 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 221 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91481 = 13 \times 31 \times 227 \]
91481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 102144 |
| Euler totient φ(n) | 81360 |
| Square | 8368773361 |
| Cube | 765583755837641 |
| Square root | 302.458262 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 221 |
| Scientific notation | 9.1481 × |
91481 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand four hundred and eighty-one |
| Binary (base 2) | 10110010101011001 |
| Octal (base 8) | 262531 |
| Hexadecimal (base 16) | 16559 |
| Base 3 | 11122111012 |
| As time | 91481 seconds = 25 h 24 min 41 s |
Is 91481 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 1) | 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 5) | 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 5) | 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 5) | 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 91481 a prime number?
No. 91481 = 13 × 31 × 227, so it is divisible by 13.
What are the factors of 91481?
1, 13, 31, 227, 403, 2951, 7037, 91481.
What is 91481 in binary?
10110010101011001 (hexadecimal 16559, octal 262531).
What is the square root of 91481?
About 302.4583.
Is 91481 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 91481?
It is a composite number with 8 divisors.