The number 83902
83902 is a composite number with 16 divisors. Its prime factorisation is 2 × 7 × 13 × 461. Divisors (16): 1, 2, 7, 13, 14, 26, 91, 182, 461, 922, 3227, 5993, 6454, 11986, 41951, 83902.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
83902 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
83902 is composite. Its prime factorisation is
- 3
The divisors add up to 155232; without 83902 itself that is 71330, so 83902 is deficient (71330 is less than 83902). Euler's totient φ(83902) = 33120 numbers up to 83902 share no factor with it.
- 4
The digits of 83902 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 94 steps to reach 1.
LaTeX source of the formulas on this page
\[ 83902 = 2 \times 7 \times 13 \times 461 \]
83902 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 155232 |
| Euler totient φ(n) | 33120 |
| Square | 7039545604 |
| Cube | 590631955266808 |
| Square root | 289.658420 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 94 |
| Scientific notation | 8.3902 × |
83902 in other forms
| Form | Value |
|---|---|
| In words | eighty-three thousand nine hundred and two |
| Binary (base 2) | 10100011110111110 |
| Octal (base 8) | 243676 |
| Hexadecimal (base 16) | 147BE |
| Base 3 | 11021002111 |
| As time | 83902 seconds = 23 h 18 min 22 s |
Is 83902 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (83902 ÷ 2 = 41951) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (83902 ÷ 7 = 11986) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 83902 a prime number?
No. 83902 = 2 × 7 × 13 × 461, so it is divisible by 2.
What are the factors of 83902?
1, 2, 7, 13, 14, 26, 91, 182, 461, 922, 3227, 5993, 6454, 11986, 41951, 83902.
What is 83902 in binary?
10100011110111110 (hexadecimal 147BE, octal 243676).
What is the square root of 83902?
About 289.6584.
Is 83902 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 83902?
It is a composite number with 16 divisors.