The number 91748
91748 is a composite number with 6 divisors. Its prime factorisation is × 22937. Divisors (6): 1, 2, 4, 22937, 45874, 91748.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91748 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91748 is composite. Its prime factorisation is
- 3
The divisors add up to 160566; without 91748 itself that is 68818, so 91748 is deficient (68818 is less than 91748). Euler's totient φ(91748) = 45872 numbers up to 91748 share no factor with it.
- 4
The digits of 91748 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91748 = 2^{2} \times 22937 \]91748 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 160566 |
| Euler totient φ(n) | 45872 |
| Square | 8417695504 |
| Cube | 772306727100992 |
| Square root | 302.899323 (= 2√22937) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 71 |
| Scientific notation | 9.1748 × |
91748 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand seven hundred and forty-eight |
| Binary (base 2) | 10110011001100100 |
| Octal (base 8) | 263144 |
| Hexadecimal (base 16) | 16664 |
| Base 3 | 11122212002 |
| As time | 91748 seconds = 25 h 29 min 8 s |
Is 91748 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (91748 ÷ 2 = 45874) | 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 (91748 ÷ 4 = 22937) | 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 | No (remainder 6) | 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 8) | 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 91748 a prime number?
No. 91748 = × 22937, so it is divisible by 2.
What are the factors of 91748?
1, 2, 4, 22937, 45874, 91748.
What is 91748 in binary?
10110011001100100 (hexadecimal 16664, octal 263144).
What is the square root of 91748?
About 302.8993, exactly 2√22937.
Is 91748 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 91748?
It is a composite number with 6 divisors.