The number 91273
91273 is a composite number with 16 divisors. Its prime factorisation is 7 × 13 × 17 × 59. Divisors (16): 1, 7, 13, 17, 59, 91, 119, 221, 413, 767, 1003, 1547, 5369, 7021, 13039, 91273.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91273 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91273 is composite. Its prime factorisation is
- 3
The divisors add up to 120960; without 91273 itself that is 29687, so 91273 is deficient (29687 is less than 91273). Euler's totient φ(91273) = 66816 numbers up to 91273 share no factor with it.
- 4
The digits of 91273 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91273 = 7 \times 13 \times 17 \times 59 \]
91273 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 120960 |
| Euler totient φ(n) | 66816 |
| Square | 8330760529 |
| Cube | 760373505763417 |
| Square root | 302.114217 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.1273 × |
91273 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand two hundred and seventy-three |
| Binary (base 2) | 10110010010001001 |
| Octal (base 8) | 262211 |
| Hexadecimal (base 16) | 16489 |
| Base 3 | 11122012111 |
| As time | 91273 seconds = 25 h 21 min 13 s |
Is 91273 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 1) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (91273 ÷ 7 = 13039) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91273 a prime number?
No. 91273 = 7 × 13 × 17 × 59, so it is divisible by 7.
What are the factors of 91273?
1, 7, 13, 17, 59, 91, 119, 221, 413, 767, 1003, 1547, 5369, 7021, 13039, 91273.
What is 91273 in binary?
10110010010001001 (hexadecimal 16489, octal 262211).
What is the square root of 91273?
About 302.1142.
Is 91273 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 91273?
It is a composite number with 16 divisors.