1,985,226

2 × 3 × 17 × 19463

1,985,226 factors as 2 × 3 × 17 × 19463. Its 16 positive divisors give a proper-divisor sum of 2,218,998, so this integer is abundant. The Collatz stopping time is 184 steps.

Prime Factor Structure

Factorization String 2 × 3 × 17 × 19463

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 4,204,224

Proper Divisor Sum 2,218,998

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #1985219 ← → #1985227

Radix Representation

Decimal	1985226
Binary	111100100101011001010 (21 bits)
Octal	0o7445312
Hexadecimal	0x1E4ACA

Divisor Catalog (16)

1 2 3 6 17 34 51 102 19,463 38,926 58,389 116,778 330,871 661,742 992,613 1,985,226

Collatz Trajectory (184 steps to reach 1)

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

1,985,226 992,613 2,977,840 1,488,920 744,460 372,230 186,115 558,346 279,173 837,520 418,760 209,380 104,690 52,345 157,036 78,518 39,259 117,778 58,889 176,668 88,334 44,167 132,502 66,251 198,754 99,377 298,132 149,066 74,533 223,600 111,800 55,900 27,950 13,975 41,926 20,963 62,890 31,445 94,336 47,168 23,584 11,792 5,896 2,948 1,474 737 2,212 1,106 553 1,660 830 415 1,246 623 1,870 935 2,806 1,403 4,210 2,105

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,985,225 Browse Full Index Next Integer #1,985,227 →