4,289,526

2 × 3² × 238307

4,289,526 factors as 2 × 3^2 × 238307. Its 12 positive divisors give a proper-divisor sum of 5,004,486, so this integer is abundant. The Collatz stopping time is 123 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 238307

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 9,294,012

Proper Divisor Sum 5,004,486

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #4289513 ← → #4289531

Radix Representation

Decimal	4289526
Binary	10000010111001111110110 (23 bits)
Octal	0o20271766
Hexadecimal	0x4173F6

Divisor Catalog (12)

1 2 3 6 9 18 238,307 476,614 714,921 1,429,842 2,144,763 4,289,526

Collatz Trajectory (123 steps to reach 1)

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

4,289,526 2,144,763 6,434,290 3,217,145 9,651,436 4,825,718 2,412,859 7,238,578 3,619,289 10,857,868 5,428,934 2,714,467 8,143,402 4,071,701 12,215,104 6,107,552 3,053,776 1,526,888 763,444 381,722 190,861 572,584 286,292 143,146 71,573 214,720 107,360 53,680 26,840 13,420 6,710 3,355 10,066 5,033 15,100 7,550 3,775 11,326 5,663 16,990 8,495 25,486 12,743 38,230 19,115 57,346 28,673 86,020 43,010 21,505 64,516 32,258 16,129 48,388 24,194 12,097 36,292 18,146 9,073 27,220

← Previous Integer #4,289,525 Browse Full Index Next Integer #4,289,527 →