2,833,728

2⁶ × 3 × 14759

2,833,728 factors as 2^6 × 3 × 14759. Its 28 positive divisors give a proper-divisor sum of 4,664,352, so this integer is abundant. The Collatz stopping time is 107 steps.

Prime Factor Structure

Factorization String 2^6 × 3 × 14759

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 28

Divisor Sum (σ) 7,498,080

Proper Divisor Sum 4,664,352

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #2833723 ← → #2833729

Radix Representation

Decimal	2833728
Binary	1010110011110101000000 (22 bits)
Octal	0o12636500
Hexadecimal	0x2B3D40

Divisor Catalog (28)

Collatz Trajectory (107 steps to reach 1)

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

2,833,728 1,416,864 708,432 354,216 177,108 88,554 44,277 132,832 66,416 33,208 16,604 8,302 4,151 12,454 6,227 18,682 9,341 28,024 14,012 7,006 3,503 10,510 5,255 15,766 7,883 23,650 11,825 35,476 17,738 8,869 26,608 13,304 6,652 3,326 1,663 4,990 2,495 7,486 3,743 11,230 5,615 16,846 8,423 25,270 12,635 37,906 18,953 56,860 28,430 14,215 42,646 21,323 63,970 31,985 95,956 47,978 23,989 71,968 35,984 17,992

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,833,727 Browse Full Index Next Integer #2,833,729 →