2,912,665

5 × 7 × 83219

2,912,665 factors as 5 × 7 × 83219. Its 8 positive divisors give a proper-divisor sum of 1,081,895, so this integer is deficient. The Collatz stopping time is 138 steps.

Prime Factor Structure

Factorization String 5 × 7 × 83219

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 3,994,560

Proper Divisor Sum 1,081,895

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #2912659 ← → #2912683

Radix Representation

Decimal	2912665
Binary	1011000111000110011001 (22 bits)
Octal	0o13070631
Hexadecimal	0x2C7199

Divisor Catalog (8)

1 5 7 35 83,219 416,095 582,533 2,912,665

Collatz Trajectory (138 steps to reach 1)

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

2,912,665 8,737,996 4,368,998 2,184,499 6,553,498 3,276,749 9,830,248 4,915,124 2,457,562 1,228,781 3,686,344 1,843,172 921,586 460,793 1,382,380 691,190 345,595 1,036,786 518,393 1,555,180 777,590 388,795 1,166,386 583,193 1,749,580 874,790 437,395 1,312,186 656,093 1,968,280 984,140 492,070 246,035 738,106 369,053 1,107,160 553,580 276,790 138,395 415,186 207,593 622,780 311,390 155,695 467,086 233,543 700,630 350,315 1,050,946 525,473 1,576,420 788,210 394,105 1,182,316 591,158 295,579 886,738 443,369 1,330,108 665,054

← Previous Integer #2,912,664 Browse Full Index Next Integer #2,912,666 →