The number 91028
91028 is a composite number with 12 divisors. Its prime factorisation is × 7 × 3251. Divisors (12): 1, 2, 4, 7, 14, 28, 3251, 6502, 13004, 22757, 45514, 91028.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91028 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91028 is composite. Its prime factorisation is
- 3
The divisors add up to 182112; without 91028 itself that is 91084, so 91028 is abundant (91084 is more than 91028). Euler's totient φ(91028) = 39000 numbers up to 91028 share no factor with it.
- 4
The digits of 91028 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91028 = 2^{2} \times 7 \times 3251 \]91028 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 182112 |
| Euler totient φ(n) | 39000 |
| Square | 8286096784 |
| Cube | 754266818053952 |
| Square root | 301.708469 (= 2√22757) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 133 |
| Scientific notation | 9.1028 × |
91028 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand and twenty-eight |
| Binary (base 2) | 10110001110010100 |
| Octal (base 8) | 261624 |
| Hexadecimal (base 16) | 16394 |
| Base 3 | 11121212102 |
| As time | 91028 seconds = 25 h 17 min 8 s |
Is 91028 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (91028 ÷ 2 = 45514) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (91028 ÷ 4 = 22757) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (91028 ÷ 7 = 13004) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91028 a prime number?
No. 91028 = × 7 × 3251, so it is divisible by 2.
What are the factors of 91028?
1, 2, 4, 7, 14, 28, 3251, 6502, 13004, 22757, 45514, 91028.
What is 91028 in binary?
10110001110010100 (hexadecimal 16394, octal 261624).
What is the square root of 91028?
About 301.7085, exactly 2√22757.
Is 91028 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 91028?
It is a composite number with 12 divisors.