The number 83391
83391 is a composite number with 24 divisors. Its prime factorisation is 3 × 7 × 11 × . Divisors (24): 1, 3, 7, 11, 19, 21, 33, 57, 77, 133, 209, 231, 361, 399, 627, 1083 … 83391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
83391 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
83391 is composite. Its prime factorisation is
- 3
The divisors add up to 146304; without 83391 itself that is 62913, so 83391 is deficient (62913 is less than 83391). Euler's totient φ(83391) = 41040 numbers up to 83391 share no factor with it.
- 4
The digits of 83391 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 257 steps to reach 1.
LaTeX source of the formulas on this page
\[ 83391 = 3 \times 7 \times 11 \times 19^{2} \]83391 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 146304 |
| Euler totient φ(n) | 41040 |
| Square | 6954058881 |
| Cube | 579905924145471 |
| Square root | 288.774999 (= 19√231) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 257 |
| Scientific notation | 8.3391 × |
83391 in other forms
| Form | Value |
|---|---|
| In words | eighty-three thousand three hundred and ninety-one |
| Binary (base 2) | 10100010110111111 |
| Octal (base 8) | 242677 |
| Hexadecimal (base 16) | 145BF |
| Base 3 | 11020101120 |
| As time | 83391 seconds = 23 h 9 min 51 s |
Is 83391 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 | Yes (83391 ÷ 3 = 27797) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (83391 ÷ 7 = 11913) | 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 6) | 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 (83391 ÷ 11 = 7581) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 83391 a prime number?
No. 83391 = 3 × 7 × 11 × , so it is divisible by 3.
What are the factors of 83391?
1, 3, 7, 11, 19, 21, 33, 57, 77, 133, 209, 231, 361, 399, 627, 1083, 1463, 2527, 3971, 4389, 7581, 11913, 27797, 83391.
What is 83391 in binary?
10100010110111111 (hexadecimal 145BF, octal 242677).
What is the square root of 83391?
About 288.7750, exactly 19√231.
Is 83391 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 83391?
It is a composite number with 24 divisors.