The number 91078
91078 is a composite number with 16 divisors. Its prime factorisation is 2 × 13 × 31 × 113. Divisors (16): 1, 2, 13, 26, 31, 62, 113, 226, 403, 806, 1469, 2938, 3503, 7006, 45539, 91078.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91078 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91078 is composite. Its prime factorisation is
- 3
The divisors add up to 153216; without 91078 itself that is 62138, so 91078 is deficient (62138 is less than 91078). Euler's totient φ(91078) = 40320 numbers up to 91078 share no factor with it.
- 4
The digits of 91078 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91078 = 2 \times 13 \times 31 \times 113 \]
91078 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 153216 |
| Euler totient φ(n) | 40320 |
| Square | 8295202084 |
| Cube | 755510415406552 |
| Square root | 301.791319 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 71 |
| Scientific notation | 9.1078 × |
91078 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand and seventy-eight |
| Binary (base 2) | 10110001111000110 |
| Octal (base 8) | 261706 |
| Hexadecimal (base 16) | 163C6 |
| Base 3 | 11121221021 |
| As time | 91078 seconds = 25 h 17 min 58 s |
Is 91078 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (91078 ÷ 2 = 45539) | 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 2) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91078 a prime number?
No. 91078 = 2 × 13 × 31 × 113, so it is divisible by 2.
What are the factors of 91078?
1, 2, 13, 26, 31, 62, 113, 226, 403, 806, 1469, 2938, 3503, 7006, 45539, 91078.
What is 91078 in binary?
10110001111000110 (hexadecimal 163C6, octal 261706).
What is the square root of 91078?
About 301.7913.
Is 91078 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 91078?
It is a composite number with 16 divisors.