The number 91752
91752 is a composite number with 16 divisors. Its prime factorisation is × 3 × 3823. Divisors (16): 1, 2, 3, 4, 6, 8, 12, 24, 3823, 7646, 11469, 15292, 22938, 30584, 45876, 91752.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91752: a Harshad number: divisible by its digit sum 24.
- 2
91752 is composite. Its prime factorisation is
- 3
The divisors add up to 229440; without 91752 itself that is 137688, so 91752 is abundant (137688 is more than 91752). Euler's totient φ(91752) = 30576 numbers up to 91752 share no factor with it.
- 4
The digits of 91752 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 32 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91752 = 2^{3} \times 3 \times 3823 \]91752 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 229440 |
| Euler totient φ(n) | 30576 |
| Square | 8418429504 |
| Cube | 772407743851008 |
| Square root | 302.905926 (= 2√22938) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 32 |
| Scientific notation | 9.1752 × |
91752 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand seven hundred and fifty-two |
| Binary (base 2) | 10110011001101000 |
| Octal (base 8) | 263150 |
| Hexadecimal (base 16) | 16668 |
| Base 3 | 11122212020 |
| As time | 91752 seconds = 25 h 29 min 12 s |
Is 91752 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (91752 ÷ 2 = 45876) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (91752 ÷ 3 = 30584) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (91752 ÷ 4 = 22938) | 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 | Yes (91752 ÷ 6 = 15292) | 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 | Yes (91752 ÷ 8 = 11469) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (91752 ÷ 12 = 7646) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91752 a prime number?
No. 91752 = × 3 × 3823, so it is divisible by 2.
What are the factors of 91752?
1, 2, 3, 4, 6, 8, 12, 24, 3823, 7646, 11469, 15292, 22938, 30584, 45876, 91752.
What is 91752 in binary?
10110011001101000 (hexadecimal 16668, octal 263150).
What is the square root of 91752?
About 302.9059, exactly 2√22938.
Is 91752 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 91752?
91752 is a Harshad number: divisible by its digit sum 24.