107,904
27 × 3 × 281
Abundant
Even
Composite
107,904 factors as 2^7 × 3 × 281. Its 32 positive divisors give a proper-divisor sum of 179,736, so this integer is abundant. The Collatz stopping time is 48 steps.
Resources
Prime Factor Structure
Factorization String
2^7 × 3 × 281
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
287,640
Proper Divisor Sum
179,736
Digit Sum / Digital Root
21 (Root: 3)
Adjacent Primes
#107903 ← → #107923
Radix Representation
| Decimal | 107904 |
| Binary | 11010010110000000 (17 bits) |
| Octal | 0o322600 |
| Hexadecimal | 0x1A580 |
Divisor Catalog (5 of 32)
Collatz Trajectory (48 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):
Showing the first 5 trajectory entries; the stopping-time total above is unchanged.