The number 91047
91047 is a composite number with 16 divisors. Its prime factorisation is 3 × 11 × 31 × 89. Divisors (16): 1, 3, 11, 31, 33, 89, 93, 267, 341, 979, 1023, 2759, 2937, 8277, 30349, 91047.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91047 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91047 is composite. Its prime factorisation is
- 3
The divisors add up to 138240; without 91047 itself that is 47193, so 91047 is deficient (47193 is less than 91047). Euler's totient φ(91047) = 52800 numbers up to 91047 share no factor with it.
- 4
The digits of 91047 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91047 = 3 \times 11 \times 31 \times 89 \]
91047 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 138240 |
| Euler totient φ(n) | 52800 |
| Square | 8289556209 |
| Cube | 754739224160823 |
| Square root | 301.739954 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.1047 × |
91047 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand and forty-seven |
| Binary (base 2) | 10110001110100111 |
| Octal (base 8) | 261647 |
| Hexadecimal (base 16) | 163A7 |
| Base 3 | 11121220010 |
| As time | 91047 seconds = 25 h 17 min 27 s |
Is 91047 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 (91047 ÷ 3 = 30349) | 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 | No (remainder 2) | 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 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (91047 ÷ 11 = 8277) | 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 91047 a prime number?
No. 91047 = 3 × 11 × 31 × 89, so it is divisible by 3.
What are the factors of 91047?
1, 3, 11, 31, 33, 89, 93, 267, 341, 979, 1023, 2759, 2937, 8277, 30349, 91047.
What is 91047 in binary?
10110001110100111 (hexadecimal 163A7, octal 261647).
What is the square root of 91047?
About 301.7400.
Is 91047 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 91047?
It is a composite number with 16 divisors.