The number 91946
91946 is a composite number with 8 divisors. Its prime factorisation is 2 × 31 × 1483. Divisors (8): 1, 2, 31, 62, 1483, 2966, 45973, 91946.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91946 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91946 is composite. Its prime factorisation is
- 3
The divisors add up to 142464; without 91946 itself that is 50518, so 91946 is deficient (50518 is less than 91946). Euler's totient φ(91946) = 44460 numbers up to 91946 share no factor with it.
- 4
The digits of 91946 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 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91946 = 2 \times 31 \times 1483 \]
91946 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 142464 |
| Euler totient φ(n) | 44460 |
| Square | 8454066916 |
| Cube | 777317636658536 |
| Square root | 303.225988 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.1946 × |
91946 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand nine hundred and forty-six |
| Binary (base 2) | 10110011100101010 |
| Octal (base 8) | 263452 |
| Hexadecimal (base 16) | 1672A |
| Base 3 | 11200010102 |
| As time | 91946 seconds = 25 h 32 min 26 s |
Is 91946 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (91946 ÷ 2 = 45973) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 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 2) | 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 6) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91946 a prime number?
No. 91946 = 2 × 31 × 1483, so it is divisible by 2.
What are the factors of 91946?
1, 2, 31, 62, 1483, 2966, 45973, 91946.
What is 91946 in binary?
10110011100101010 (hexadecimal 1672A, octal 263452).
What is the square root of 91946?
About 303.2260.
Is 91946 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 91946?
It is a composite number with 8 divisors.