2,012,124

2² × 3 × 167677

2,012,124 factors as 2^2 × 3 × 167677. Its 12 positive divisors give a proper-divisor sum of 2,682,860, so this integer is abundant. The Collatz stopping time is 153 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 167677

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 4,694,984

Proper Divisor Sum 2,682,860

Digit Sum / Digital Root 12 (Root: 3)

Adjacent Primes #2012123 ← → #2012147

Radix Representation

Decimal	2012124
Binary	111101011001111011100 (21 bits)
Octal	0o7531734
Hexadecimal	0x1EB3DC

Divisor Catalog (12)

1 2 3 4 6 12 167,677 335,354 503,031 670,708 1,006,062 2,012,124

Collatz Trajectory (153 steps to reach 1)

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

2,012,124 1,006,062 503,031 1,509,094 754,547 2,263,642 1,131,821 3,395,464 1,697,732 848,866 424,433 1,273,300 636,650 318,325 954,976 477,488 238,744 119,372 59,686 29,843 89,530 44,765 134,296 67,148 33,574 16,787 50,362 25,181 75,544 37,772 18,886 9,443 28,330 14,165 42,496 21,248 10,624 5,312 2,656 1,328 664 332 166 83 250 125 376 188 94 47 142 71 214 107 322 161 484 242 121 364

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,012,123 Browse Full Index Next Integer #2,012,125 →