3,501,786

2 × 3 × 583631

3,501,786 factors as 2 × 3 × 583631. Its 8 positive divisors give a proper-divisor sum of 3,501,798, so this integer is abundant. The Collatz stopping time is 128 steps.

Prime Factor Structure

Factorization String 2 × 3 × 583631

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 7,003,584

Proper Divisor Sum 3,501,798

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3501781 ← → #3501787

Radix Representation

Decimal	3501786
Binary	1101010110111011011010 (22 bits)
Octal	0o15267332
Hexadecimal	0x356EDA

Divisor Catalog (8)

1 2 3 6 583,631 1,167,262 1,750,893 3,501,786

Collatz Trajectory (128 steps to reach 1)

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

3,501,786 1,750,893 5,252,680 2,626,340 1,313,170 656,585 1,969,756 984,878 492,439 1,477,318 738,659 2,215,978 1,107,989 3,323,968 1,661,984 830,992 415,496 207,748 103,874 51,937 155,812 77,906 38,953 116,860 58,430 29,215 87,646 43,823 131,470 65,735 197,206 98,603 295,810 147,905 443,716 221,858 110,929 332,788 166,394 83,197 249,592 124,796 62,398 31,199 93,598 46,799 140,398 70,199 210,598 105,299 315,898 157,949 473,848 236,924 118,462 59,231 177,694 88,847 266,542 133,271

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,501,785 Browse Full Index Next Integer #3,501,787 →