5,321,322

2 × 3³ × 98543

5,321,322 factors as 2 × 3^3 × 98543. Its 16 positive divisors give a proper-divisor sum of 6,503,958, so this integer is abundant. The Collatz stopping time is 157 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 98543

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 11,825,280

Proper Divisor Sum 6,503,958

Digit Sum / Digital Root 18 (Root: 9)

Adjacent Primes #5321317 ← → #5321333

Radix Representation

Decimal	5321322
Binary	10100010011001001101010 (23 bits)
Octal	0o24231152
Hexadecimal	0x51326A

Divisor Catalog (16)

1 2 3 6 9 18 27 54 98,543 197,086 295,629 591,258 886,887 1,773,774 2,660,661 5,321,322

Collatz Trajectory (157 steps to reach 1)

Iterative sequence n → n/2 (if even) or 3n+1 (if odd):

5,321,322 2,660,661 7,981,984 3,990,992 1,995,496 997,748 498,874 249,437 748,312 374,156 187,078 93,539 280,618 140,309 420,928 210,464 105,232 52,616 26,308 13,154 6,577 19,732 9,866 4,933 14,800 7,400 3,700 1,850 925 2,776 1,388 694 347 1,042 521 1,564 782 391 1,174 587 1,762 881 2,644 1,322 661 1,984 992 496 248 124 62 31 94 47 142 71 214 107 322 161

← Previous Integer #5,321,321 Browse Full Index Next Integer #5,321,323 →