20,409,366

2 × 3 × 3401561

20,409,366 factors as 2 × 3 × 3401561. Its 8 positive divisors give a proper-divisor sum of 20,409,378, so this integer is abundant. The Collatz stopping time is 177 steps.

Prime Factor Structure

Factorization String 2 × 3 × 3401561

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 40,818,744

Proper Divisor Sum 20,409,378

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #20409353 ← → #20409371

Radix Representation

Decimal	20409366
Binary	1001101110110110000010110 (25 bits)
Octal	0o115666026
Hexadecimal	0x1376C16

Divisor Catalog (8)

1 2 3 6 3,401,561 6,803,122 10,204,683 20,409,366

Collatz Trajectory (177 steps to reach 1)

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

20,409,366 10,204,683 30,614,050 15,307,025 45,921,076 22,960,538 11,480,269 34,440,808 17,220,404 8,610,202 4,305,101 12,915,304 6,457,652 3,228,826 1,614,413 4,843,240 2,421,620 1,210,810 605,405 1,816,216 908,108 454,054 227,027 681,082 340,541 1,021,624 510,812 255,406 127,703 383,110 191,555 574,666 287,333 862,000 431,000 215,500 107,750 53,875 161,626 80,813 242,440 121,220 60,610 30,305 90,916 45,458 22,729 68,188 34,094 17,047 51,142 25,571 76,714 38,357 115,072 57,536 28,768 14,384 7,192 3,596

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #20,409,365 Browse Full Index Next Integer #20,409,367 →