2,055,432

2³ × 3 × 85643

2,055,432 factors as 2^3 × 3 × 85643. Its 16 positive divisors give a proper-divisor sum of 3,083,208, so this integer is abundant. The Collatz stopping time is 197 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 85643

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 5,138,640

Proper Divisor Sum 3,083,208

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #2055409 ← → #2055437

Radix Representation

Decimal	2055432
Binary	111110101110100001000 (21 bits)
Octal	0o7656410
Hexadecimal	0x1F5D08

Divisor Catalog (16)

1 2 3 4 6 8 12 24 85,643 171,286 256,929 342,572 513,858 685,144 1,027,716 2,055,432

Collatz Trajectory (197 steps to reach 1)

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

2,055,432 1,027,716 513,858 256,929 770,788 385,394 192,697 578,092 289,046 144,523 433,570 216,785 650,356 325,178 162,589 487,768 243,884 121,942 60,971 182,914 91,457 274,372 137,186 68,593 205,780 102,890 51,445 154,336 77,168 38,584 19,292 9,646 4,823 14,470 7,235 21,706 10,853 32,560 16,280 8,140 4,070 2,035 6,106 3,053 9,160 4,580 2,290 1,145 3,436 1,718 859 2,578 1,289 3,868 1,934 967 2,902 1,451 4,354 2,177

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,055,431 Browse Full Index Next Integer #2,055,433 →