4,096,746

2 × 3² × 227597

4,096,746 factors as 2 × 3^2 × 227597. Its 12 positive divisors give a proper-divisor sum of 4,779,576, so this integer is abundant. The Collatz stopping time is 154 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 227597

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 8,876,322

Proper Divisor Sum 4,779,576

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #4096727 ← → #4096753

Radix Representation

Decimal	4096746
Binary	1111101000001011101010 (22 bits)
Octal	0o17501352
Hexadecimal	0x3E82EA

Divisor Catalog (12)

1 2 3 6 9 18 227,597 455,194 682,791 1,365,582 2,048,373 4,096,746

Collatz Trajectory (154 steps to reach 1)

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

4,096,746 2,048,373 6,145,120 3,072,560 1,536,280 768,140 384,070 192,035 576,106 288,053 864,160 432,080 216,040 108,020 54,010 27,005 81,016 40,508 20,254 10,127 30,382 15,191 45,574 22,787 68,362 34,181 102,544 51,272 25,636 12,818 6,409 19,228 9,614 4,807 14,422 7,211 21,634 10,817 32,452 16,226 8,113 24,340 12,170 6,085 18,256 9,128 4,564 2,282 1,141 3,424 1,712 856 428 214 107 322 161 484 242 121

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

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