The number 91215
91215 is a composite number with 12 divisors. Its prime factorisation is × 5 × 2027. Divisors (12): 1, 3, 5, 9, 15, 45, 2027, 6081, 10135, 18243, 30405, 91215.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91215 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91215 is composite. Its prime factorisation is
- 3
The divisors add up to 158184; without 91215 itself that is 66969, so 91215 is deficient (66969 is less than 91215). Euler's totient φ(91215) = 48624 numbers up to 91215 share no factor with it.
- 4
The digits of 91215 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 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91215 = 3^{2} \times 5 \times 2027 \]91215 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 158184 |
| Euler totient φ(n) | 48624 |
| Square | 8320176225 |
| Cube | 758924874363375 |
| Square root | 302.018211 (= 3√10135) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.1215 × |
91215 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand two hundred and fifteen |
| Binary (base 2) | 10110010001001111 |
| Octal (base 8) | 262117 |
| Hexadecimal (base 16) | 1644F |
| Base 3 | 11122010100 |
| As time | 91215 seconds = 25 h 20 min 15 s |
Is 91215 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 (91215 ÷ 3 = 30405) | 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 | Yes (91215 ÷ 5 = 18243) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (91215 ÷ 9 = 10135) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91215 a prime number?
No. 91215 = × 5 × 2027, so it is divisible by 3.
What are the factors of 91215?
1, 3, 5, 9, 15, 45, 2027, 6081, 10135, 18243, 30405, 91215.
What is 91215 in binary?
10110010001001111 (hexadecimal 1644F, octal 262117).
What is the square root of 91215?
About 302.0182, exactly 3√10135.
Is 91215 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 91215?
It is a composite number with 12 divisors.