3,110,138

2 × 677 × 2297

3,110,138 factors as 2 × 677 × 2297. Its 8 positive divisors give a proper-divisor sum of 1,563,994, so this integer is deficient. The Collatz stopping time is 151 steps.

Prime Factor Structure

Factorization String 2 × 677 × 2297

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 4,674,132

Proper Divisor Sum 1,563,994

Digit Sum / Digital Root 17 (Root: 8)

Adjacent Primes #3110101 ← → #3110143

Radix Representation

Decimal	3110138
Binary	1011110111010011111010 (22 bits)
Octal	0o13672372
Hexadecimal	0x2F74FA

Divisor Catalog (8)

1 2 677 1,354 2,297 4,594 1,555,069 3,110,138

Collatz Trajectory (151 steps to reach 1)

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

3,110,138 1,555,069 4,665,208 2,332,604 1,166,302 583,151 1,749,454 874,727 2,624,182 1,312,091 3,936,274 1,968,137 5,904,412 2,952,206 1,476,103 4,428,310 2,214,155 6,642,466 3,321,233 9,963,700 4,981,850 2,490,925 7,472,776 3,736,388 1,868,194 934,097 2,802,292 1,401,146 700,573 2,101,720 1,050,860 525,430 262,715 788,146 394,073 1,182,220 591,110 295,555 886,666 443,333 1,330,000 665,000 332,500 166,250 83,125 249,376 124,688 62,344 31,172 15,586 7,793 23,380 11,690 5,845 17,536 8,768 4,384 2,192 1,096 548

← Previous Integer #3,110,137 Browse Full Index Next Integer #3,110,139 →