2,631,162

2 × 3 × 438527

2,631,162 factors as 2 × 3 × 438527. Its 8 positive divisors give a proper-divisor sum of 2,631,174, so this integer is abundant. The Collatz stopping time is 174 steps.

Prime Factor Structure

Factorization String 2 × 3 × 438527

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 5,262,336

Proper Divisor Sum 2,631,174

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #2631149 ← → #2631173

Radix Representation

Decimal	2631162
Binary	1010000010010111111010 (22 bits)
Octal	0o12022772
Hexadecimal	0x2825FA

Divisor Catalog (8)

1 2 3 6 438,527 877,054 1,315,581 2,631,162

Collatz Trajectory (174 steps to reach 1)

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

2,631,162 1,315,581 3,946,744 1,973,372 986,686 493,343 1,480,030 740,015 2,220,046 1,110,023 3,330,070 1,665,035 4,995,106 2,497,553 7,492,660 3,746,330 1,873,165 5,619,496 2,809,748 1,404,874 702,437 2,107,312 1,053,656 526,828 263,414 131,707 395,122 197,561 592,684 296,342 148,171 444,514 222,257 666,772 333,386 166,693 500,080 250,040 125,020 62,510 31,255 93,766 46,883 140,650 70,325 210,976 105,488 52,744 26,372 13,186 6,593 19,780 9,890 4,945 14,836 7,418 3,709 11,128 5,564 2,782

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,631,161 Browse Full Index Next Integer #2,631,163 →