The number 91052
91052 is a composite number with 24 divisors. Its prime factorisation is × 13 × 17 × 103. Divisors (24): 1, 2, 4, 13, 17, 26, 34, 52, 68, 103, 206, 221, 412, 442, 884, 1339 … 91052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91052: a Harshad number: divisible by its digit sum 17.
- 2
91052 is composite. Its prime factorisation is
- 3
The divisors add up to 183456; without 91052 itself that is 92404, so 91052 is abundant (92404 is more than 91052). Euler's totient φ(91052) = 39168 numbers up to 91052 share no factor with it.
- 4
The digits of 91052 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 208 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91052 = 2^{2} \times 13 \times 17 \times 103 \]91052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 183456 |
| Euler totient φ(n) | 39168 |
| Square | 8290466704 |
| Cube | 754863574332608 |
| Square root | 301.748239 (= 2√22763) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 208 |
| Scientific notation | 9.1052 × |
91052 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand and fifty-two |
| Binary (base 2) | 10110001110101100 |
| Octal (base 8) | 261654 |
| Hexadecimal (base 16) | 163AC |
| Base 3 | 11121220022 |
| As time | 91052 seconds = 25 h 17 min 32 s |
Is 91052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (91052 ÷ 2 = 45526) | 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 (91052 ÷ 4 = 22763) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 91052 a prime number?
No. 91052 = × 13 × 17 × 103, so it is divisible by 2.
What are the factors of 91052?
1, 2, 4, 13, 17, 26, 34, 52, 68, 103, 206, 221, 412, 442, 884, 1339, 1751, 2678, 3502, 5356, 7004, 22763, 45526, 91052.
What is 91052 in binary?
10110001110101100 (hexadecimal 163AC, octal 261654).
What is the square root of 91052?
About 301.7482, exactly 2√22763.
Is 91052 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 91052?
91052 is a Harshad number: divisible by its digit sum 17.