8,306,322

2 × 3 × 1384387

8,306,322 factors as 2 × 3 × 1384387. Its 8 positive divisors give a proper-divisor sum of 8,306,334, so this integer is abundant. The Collatz stopping time is 168 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1384387

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 16,612,656

Proper Divisor Sum 8,306,334

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #8306299 ← → #8306323

Radix Representation

Decimal	8306322
Binary	11111101011111010010010 (23 bits)
Octal	0o37537222
Hexadecimal	0x7EBE92

Divisor Catalog (8)

1 2 3 6 1,384,387 2,768,774 4,153,161 8,306,322

Collatz Trajectory (168 steps to reach 1)

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

8,306,322 4,153,161 12,459,484 6,229,742 3,114,871 9,344,614 4,672,307 14,016,922 7,008,461 21,025,384 10,512,692 5,256,346 2,628,173 7,884,520 3,942,260 1,971,130 985,565 2,956,696 1,478,348 739,174 369,587 1,108,762 554,381 1,663,144 831,572 415,786 207,893 623,680 311,840 155,920 77,960 38,980 19,490 9,745 29,236 14,618 7,309 21,928 10,964 5,482 2,741 8,224 4,112 2,056 1,028 514 257 772 386 193 580 290 145 436 218 109 328 164 82 41

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

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