2,039,576

2³ × 7² × 11² × 43

2,039,576 factors as 2^3 × 7^2 × 11^2 × 43. Its 72 positive divisors give a proper-divisor sum of 2,963,884, so this integer is abundant. The Collatz stopping time is 60 steps.

Prime Factor Structure

Factorization String 2^3 × 7^2 × 11^2 × 43

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 72

Divisor Sum (σ) 5,003,460

Proper Divisor Sum 2,963,884

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #2039567 ← → #2039579

Radix Representation

Decimal	2039576
Binary	111110001111100011000 (21 bits)
Octal	0o7617430
Hexadecimal	0x1F1F18

Divisor Catalog (60 of 72)

1 2 4 7 8 11 14 22 28 43 44 49 56 77 86 88 98 121 154 172 196 242 301 308 344 392 473 484 539 602 616 847 946 968 1,078 1,204 1,694 1,892 2,107 2,156 2,408 3,311 3,388 3,784 4,214 4,312 5,203 5,929 6,622 6,776 8,428 10,406 11,858 13,244 16,856 20,812 23,177 23,716 26,488 36,421

Collatz Trajectory (60 steps to reach 1)

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

2,039,576 1,019,788 509,894 254,947 764,842 382,421 1,147,264 573,632 286,816 143,408 71,704 35,852 17,926 8,963 26,890 13,445 40,336 20,168 10,084 5,042 2,521 7,564 3,782 1,891 5,674 2,837 8,512 4,256 2,128 1,064 532 266 133 400 200 100 50 25 76 38 19 58 29 88 44 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2

← Previous Integer #2,039,575 Browse Full Index Next Integer #2,039,577 →