The number 48191
48191 is a composite number with 8 divisors. Its prime factorisation is 11 × 13 × 337. Divisors (8): 1, 11, 13, 143, 337, 3707, 4381, 48191.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48191 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48191 is composite. Its prime factorisation is
- 3
The divisors add up to 56784; without 48191 itself that is 8593, so 48191 is deficient (8593 is less than 48191). Euler's totient φ(48191) = 40320 numbers up to 48191 share no factor with it.
- 4
The digits of 48191 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 233 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48191 = 11 \times 13 \times 337 \]
48191 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 56784 |
| Euler totient φ(n) | 40320 |
| Square | 2322372481 |
| Cube | 111917452231871 |
| Square root | 219.524486 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 233 |
| Scientific notation | 4.8191 × |
48191 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand one hundred and ninety-one |
| Binary (base 2) | 1011110000111111 |
| Octal (base 8) | 136077 |
| Hexadecimal (base 16) | BC3F |
| Base 3 | 2110002212 |
| As time | 48191 seconds = 13 h 23 min 11 s |
Is 48191 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 3) | 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 5) | 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 7) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (48191 ÷ 11 = 4381) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48191 a prime number?
No. 48191 = 11 × 13 × 337, so it is divisible by 11.
What are the factors of 48191?
1, 11, 13, 143, 337, 3707, 4381, 48191.
What is 48191 in binary?
1011110000111111 (hexadecimal BC3F, octal 136077).
What is the square root of 48191?
About 219.5245.
Is 48191 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 48191?
It is a composite number with 8 divisors.