16,640,226

2 × 3² × 43 × 21499

16,640,226 factors as 2 × 3^2 × 43 × 21499. Its 24 positive divisors give a proper-divisor sum of 20,253,774, so this integer is abundant. The Collatz stopping time is 107 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 43 × 21499

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 36,894,000

Proper Divisor Sum 20,253,774

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #16640207 ← → #16640227

Radix Representation

Decimal	16640226
Binary	111111011110100011100010 (24 bits)
Octal	0o77364342
Hexadecimal	0xFDE8E2

Divisor Catalog (24)

Collatz Trajectory (107 steps to reach 1)

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

16,640,226 8,320,113 24,960,340 12,480,170 6,240,085 18,720,256 9,360,128 4,680,064 2,340,032 1,170,016 585,008 292,504 146,252 73,126 36,563 109,690 54,845 164,536 82,268 41,134 20,567 61,702 30,851 92,554 46,277 138,832 69,416 34,708 17,354 8,677 26,032 13,016 6,508 3,254 1,627 4,882 2,441 7,324 3,662 1,831 5,494 2,747 8,242 4,121 12,364 6,182 3,091 9,274 4,637 13,912 6,956 3,478 1,739 5,218 2,609 7,828 3,914 1,957 5,872 2,936

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #16,640,225 Browse Full Index Next Integer #16,640,227 →