2,190,664

2³ × 7 × 39119

2,190,664 factors as 2^3 × 7 × 39119. Its 16 positive divisors give a proper-divisor sum of 2,503,736, so this integer is abundant. The Collatz stopping time is 86 steps.

Prime Factor Structure

Factorization String 2^3 × 7 × 39119

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 4,694,400

Proper Divisor Sum 2,503,736

Digit Sum / Digital Root 28 (Root: 1)

Adjacent Primes #2190653 ← → #2190679

Radix Representation

Decimal	2190664
Binary	1000010110110101001000 (22 bits)
Octal	0o10266510
Hexadecimal	0x216D48

Divisor Catalog (16)

1 2 4 7 8 14 28 56 39,119 78,238 156,476 273,833 312,952 547,666 1,095,332 2,190,664

Collatz Trajectory (86 steps to reach 1)

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

2,190,664 1,095,332 547,666 273,833 821,500 410,750 205,375 616,126 308,063 924,190 462,095 1,386,286 693,143 2,079,430 1,039,715 3,119,146 1,559,573 4,678,720 2,339,360 1,169,680 584,840 292,420 146,210 73,105 219,316 109,658 54,829 164,488 82,244 41,122 20,561 61,684 30,842 15,421 46,264 23,132 11,566 5,783 17,350 8,675 26,026 13,013 39,040 19,520 9,760 4,880 2,440 1,220 610 305 916 458 229 688 344 172 86 43 130 65

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,190,663 Browse Full Index Next Integer #2,190,665 →