2,000,296

2³ × 250037

2,000,296 factors as 2^3 × 250037. Its 8 positive divisors give a proper-divisor sum of 1,750,274, so this integer is deficient. The Collatz stopping time is 140 steps.

Prime Factor Structure

Factorization String 2^3 × 250037

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 3,750,570

Proper Divisor Sum 1,750,274

Digit Sum / Digital Root 19 (Root: 1)

Adjacent Primes #2000293 ← → #2000303

Radix Representation

Decimal	2000296
Binary	111101000010110101000 (21 bits)
Octal	0o7502650
Hexadecimal	0x1E85A8

Divisor Catalog (8)

1 2 4 8 250,037 500,074 1,000,148 2,000,296

Collatz Trajectory (140 steps to reach 1)

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

2,000,296 1,000,148 500,074 250,037 750,112 375,056 187,528 93,764 46,882 23,441 70,324 35,162 17,581 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 1,391 4,174 2,087 6,262 3,131 9,394 4,697 14,092 7,046 3,523 10,570 5,285 15,856 7,928 3,964 1,982 991 2,974 1,487 4,462 2,231 6,694 3,347 10,042 5,021 15,064 7,532 3,766 1,883 5,650 2,825 8,476 4,238 2,119

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,000,295 Browse Full Index Next Integer #2,000,297 →