2,641,326

2 × 3 × 440221

2,641,326 factors as 2 × 3 × 440221. Its 8 positive divisors give a proper-divisor sum of 2,641,338, so this integer is abundant. The Collatz stopping time is 187 steps.

Prime Factor Structure

Factorization String 2 × 3 × 440221

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 5,282,664

Proper Divisor Sum 2,641,338

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #2641313 ← → #2641337

Radix Representation

Decimal	2641326
Binary	1010000100110110101110 (22 bits)
Octal	0o12046656
Hexadecimal	0x284DAE

Divisor Catalog (8)

1 2 3 6 440,221 880,442 1,320,663 2,641,326

Collatz Trajectory (187 steps to reach 1)

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

2,641,326 1,320,663 3,961,990 1,980,995 5,942,986 2,971,493 8,914,480 4,457,240 2,228,620 1,114,310 557,155 1,671,466 835,733 2,507,200 1,253,600 626,800 313,400 156,700 78,350 39,175 117,526 58,763 176,290 88,145 264,436 132,218 66,109 198,328 99,164 49,582 24,791 74,374 37,187 111,562 55,781 167,344 83,672 41,836 20,918 10,459 31,378 15,689 47,068 23,534 11,767 35,302 17,651 52,954 26,477 79,432 39,716 19,858 9,929 29,788 14,894 7,447 22,342 11,171 33,514 16,757

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,641,325 Browse Full Index Next Integer #2,641,327 →