The number 91949
91949 is a composite number with 8 divisors. Its prime factorisation is 11 × 13 × 643. Divisors (8): 1, 11, 13, 143, 643, 7073, 8359, 91949.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91949 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91949 is composite. Its prime factorisation is
- 3
The divisors add up to 108192; without 91949 itself that is 16243, so 91949 is deficient (16243 is less than 91949). Euler's totient φ(91949) = 77040 numbers up to 91949 share no factor with it.
- 4
The digits of 91949 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 32 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91949 = 11 \times 13 \times 643 \]
91949 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 108192 |
| Euler totient φ(n) | 77040 |
| Square | 8454618601 |
| Cube | 777393725743349 |
| Square root | 303.230935 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 32 |
| Scientific notation | 9.1949 × |
91949 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand nine hundred and forty-nine |
| Binary (base 2) | 10110011100101101 |
| Octal (base 8) | 263455 |
| Hexadecimal (base 16) | 1672D |
| Base 3 | 11200010112 |
| As time | 91949 seconds = 25 h 32 min 29 s |
Is 91949 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 2) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (91949 ÷ 11 = 8359) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91949 a prime number?
No. 91949 = 11 × 13 × 643, so it is divisible by 11.
What are the factors of 91949?
1, 11, 13, 143, 643, 7073, 8359, 91949.
What is 91949 in binary?
10110011100101101 (hexadecimal 1672D, octal 263455).
What is the square root of 91949?
About 303.2309.
Is 91949 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 91949?
It is a composite number with 8 divisors.