2,139,672

2³ × 3 × 89153

2,139,672 factors as 2^3 × 3 × 89153. Its 16 positive divisors give a proper-divisor sum of 3,209,568, so this integer is abundant. The Collatz stopping time is 96 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 89153

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 5,349,240

Proper Divisor Sum 3,209,568

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #2139661 ← → #2139677

Radix Representation

Decimal	2139672
Binary	1000001010011000011000 (22 bits)
Octal	0o10123030
Hexadecimal	0x20A618

Divisor Catalog (16)

1 2 3 4 6 8 12 24 89,153 178,306 267,459 356,612 534,918 713,224 1,069,836 2,139,672

Collatz Trajectory (96 steps to reach 1)

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

2,139,672 1,069,836 534,918 267,459 802,378 401,189 1,203,568 601,784 300,892 150,446 75,223 225,670 112,835 338,506 169,253 507,760 253,880 126,940 63,470 31,735 95,206 47,603 142,810 71,405 214,216 107,108 53,554 26,777 80,332 40,166 20,083 60,250 30,125 90,376 45,188 22,594 11,297 33,892 16,946 8,473 25,420 12,710 6,355 19,066 9,533 28,600 14,300 7,150 3,575 10,726 5,363 16,090 8,045 24,136 12,068 6,034 3,017 9,052 4,526 2,263

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,139,671 Browse Full Index Next Integer #2,139,673 →