The number 91057
91057 is a composite number with 8 divisors. Its prime factorisation is 23 × 37 × 107. Divisors (8): 1, 23, 37, 107, 851, 2461, 3959, 91057.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91057 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91057 is composite. Its prime factorisation is
- 3
The divisors add up to 98496; without 91057 itself that is 7439, so 91057 is deficient (7439 is less than 91057). Euler's totient φ(91057) = 83952 numbers up to 91057 share no factor with it.
- 4
The digits of 91057 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
\[ 91057 = 23 \times 37 \times 107 \]
91057 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 98496 |
| Euler totient φ(n) | 83952 |
| Square | 8291377249 |
| Cube | 754987938162193 |
| Square root | 301.756524 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.1057 × |
91057 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand and fifty-seven |
| Binary (base 2) | 10110001110110001 |
| Octal (base 8) | 261661 |
| Hexadecimal (base 16) | 163B1 |
| Base 3 | 11121220111 |
| As time | 91057 seconds = 25 h 17 min 37 s |
Is 91057 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 2) | 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 | 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 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 91057 a prime number?
No. 91057 = 23 × 37 × 107, so it is divisible by 23.
What are the factors of 91057?
1, 23, 37, 107, 851, 2461, 3959, 91057.
What is 91057 in binary?
10110001110110001 (hexadecimal 163B1, octal 261661).
What is the square root of 91057?
About 301.7565.
Is 91057 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 91057?
It is a composite number with 8 divisors.