4,996,746

2 × 3² × 277597

4,996,746 factors as 2 × 3^2 × 277597. Its 12 positive divisors give a proper-divisor sum of 5,829,576, so this integer is abundant. The Collatz stopping time is 113 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 277597

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 10,826,322

Proper Divisor Sum 5,829,576

Digit Sum / Digital Root 45 (Root: 9)

Adjacent Primes #4996723 ← → #4996757

Radix Representation

Decimal	4996746
Binary	10011000011111010001010 (23 bits)
Octal	0o23037212
Hexadecimal	0x4C3E8A

Divisor Catalog (12)

1 2 3 6 9 18 277,597 555,194 832,791 1,665,582 2,498,373 4,996,746

Collatz Trajectory (113 steps to reach 1)

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

4,996,746 2,498,373 7,495,120 3,747,560 1,873,780 936,890 468,445 1,405,336 702,668 351,334 175,667 527,002 263,501 790,504 395,252 197,626 98,813 296,440 148,220 74,110 37,055 111,166 55,583 166,750 83,375 250,126 125,063 375,190 187,595 562,786 281,393 844,180 422,090 211,045 633,136 316,568 158,284 79,142 39,571 118,714 59,357 178,072 89,036 44,518 22,259 66,778 33,389 100,168 50,084 25,042 12,521 37,564 18,782 9,391 28,174 14,087 42,262 21,131 63,394 31,697

← Previous Integer #4,996,745 Browse Full Index Next Integer #4,996,747 →