2,064,246

2 × 3 × 149 × 2309

2,064,246 factors as 2 × 3 × 149 × 2309. Its 16 positive divisors give a proper-divisor sum of 2,093,754, so this integer is abundant. The Collatz stopping time is 104 steps.

Prime Factor Structure

Factorization String 2 × 3 × 149 × 2309

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 4,158,000

Proper Divisor Sum 2,093,754

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #2064241 ← → #2064247

Radix Representation

Decimal	2064246
Binary	111110111111101110110 (21 bits)
Octal	0o7677566
Hexadecimal	0x1F7F76

Divisor Catalog (16)

1 2 3 6 149 298 447 894 2,309 4,618 6,927 13,854 344,041 688,082 1,032,123 2,064,246

Collatz Trajectory (104 steps to reach 1)

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

2,064,246 1,032,123 3,096,370 1,548,185 4,644,556 2,322,278 1,161,139 3,483,418 1,741,709 5,225,128 2,612,564 1,306,282 653,141 1,959,424 979,712 489,856 244,928 122,464 61,232 30,616 15,308 7,654 3,827 11,482 5,741 17,224 8,612 4,306 2,153 6,460 3,230 1,615 4,846 2,423 7,270 3,635 10,906 5,453 16,360 8,180 4,090 2,045 6,136 3,068 1,534 767 2,302 1,151 3,454 1,727 5,182 2,591 7,774 3,887 11,662 5,831 17,494 8,747 26,242 13,121

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,064,245 Browse Full Index Next Integer #2,064,247 →