The number 91521
91521 is a composite number with 6 divisors. Its prime factorisation is × 10169. Divisors (6): 1, 3, 9, 10169, 30507, 91521.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91521 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91521 is composite. Its prime factorisation is
- 3
The divisors add up to 132210; without 91521 itself that is 40689, so 91521 is deficient (40689 is less than 91521). Euler's totient φ(91521) = 61008 numbers up to 91521 share no factor with it.
- 4
The digits of 91521 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91521 = 3^{2} \times 10169 \]91521 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 132210 |
| Euler totient φ(n) | 61008 |
| Square | 8376093441 |
| Cube | 766588447813761 |
| Square root | 302.524379 (= 3√10169) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 58 |
| Scientific notation | 9.1521 × |
91521 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand five hundred and twenty-one |
| Binary (base 2) | 10110010110000001 |
| Octal (base 8) | 262601 |
| Hexadecimal (base 16) | 16581 |
| Base 3 | 11122112200 |
| As time | 91521 seconds = 25 h 25 min 21 s |
Is 91521 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 (91521 ÷ 3 = 30507) | 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 3) | 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 | Yes (91521 ÷ 9 = 10169) | 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 1) | 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 91521 a prime number?
No. 91521 = × 10169, so it is divisible by 3.
What are the factors of 91521?
1, 3, 9, 10169, 30507, 91521.
What is 91521 in binary?
10110010110000001 (hexadecimal 16581, octal 262601).
What is the square root of 91521?
About 302.5244, exactly 3√10169.
Is 91521 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 91521?
It is a composite number with 6 divisors.