4,875,426

2 × 3² × 43 × 6299

4,875,426 factors as 2 × 3^2 × 43 × 6299. Its 24 positive divisors give a proper-divisor sum of 5,935,374, so this integer is abundant. The Collatz stopping time is 61 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 43 × 6299

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 10,810,800

Proper Divisor Sum 5,935,374

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #4875407 ← → #4875439

Radix Representation

Decimal	4875426
Binary	10010100110010010100010 (23 bits)
Octal	0o22462242
Hexadecimal	0x4A64A2

Divisor Catalog (24)

Collatz Trajectory (61 steps to reach 1)

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

4,875,426 2,437,713 7,313,140 3,656,570 1,828,285 5,484,856 2,742,428 1,371,214 685,607 2,056,822 1,028,411 3,085,234 1,542,617 4,627,852 2,313,926 1,156,963 3,470,890 1,735,445 5,206,336 2,603,168 1,301,584 650,792 325,396 162,698 81,349 244,048 122,024 61,012 30,506 15,253 45,760 22,880 11,440 5,720 2,860 1,430 715 2,146 1,073 3,220 1,610 805 2,416 1,208 604 302 151 454 227 682 341 1,024 512 256 128 64 32 16 8 4

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,875,425 Browse Full Index Next Integer #4,875,427 →