The number 91455
91455 is a composite number with 32 divisors. Its prime factorisation is 3 × 5 × 7 × 13 × 67. Divisors (32): 1, 3, 5, 7, 13, 15, 21, 35, 39, 65, 67, 91, 105, 195, 201, 273 … 91455.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91455 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91455 is composite. Its prime factorisation is
- 3
The divisors add up to 182784; without 91455 itself that is 91329, so 91455 is deficient (91329 is less than 91455). Euler's totient φ(91455) = 38016 numbers up to 91455 share no factor with it.
- 4
The digits of 91455 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 164 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91455 = 3 \times 5 \times 7 \times 13 \times 67 \]
91455 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 182784 |
| Euler totient φ(n) | 38016 |
| Square | 8364017025 |
| Cube | 764931177021375 |
| Square root | 302.415277 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 164 |
| Scientific notation | 9.1455 × |
91455 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand four hundred and fifty-five |
| Binary (base 2) | 10110010100111111 |
| Octal (base 8) | 262477 |
| Hexadecimal (base 16) | 1653F |
| Base 3 | 11122110020 |
| As time | 91455 seconds = 25 h 24 min 15 s |
Is 91455 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 (91455 ÷ 3 = 30485) | 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 (91455 ÷ 5 = 18291) | 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 | Yes (91455 ÷ 7 = 13065) | 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 | No (remainder 6) | 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 1) | 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 91455 a prime number?
No. 91455 = 3 × 5 × 7 × 13 × 67, so it is divisible by 3.
What are the factors of 91455?
1, 3, 5, 7, 13, 15, 21, 35, 39, 65, 67, 91, 105, 195, 201, 273, 335, 455, 469, 871, 1005, 1365, 1407, 2345, 2613, 4355, 6097, 7035, 13065, 18291, 30485, 91455.
What is 91455 in binary?
10110010100111111 (hexadecimal 1653F, octal 262477).
What is the square root of 91455?
About 302.4153.
Is 91455 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 91455?
It is a composite number with 32 divisors.