3,976,128

2⁶ × 3⁴ × 13 × 59

3,976,128 factors as 2^6 × 3^4 × 13 × 59. Its 140 positive divisors give a proper-divisor sum of 8,932,152, so this integer is abundant. The Collatz stopping time is 66 steps.

Prime Factor Structure

Factorization String 2^6 × 3^4 × 13 × 59

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 140

Divisor Sum (σ) 12,908,280

Proper Divisor Sum 8,932,152

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #3976121 ← → #3976129

Radix Representation

Decimal	3976128
Binary	1111001010101111000000 (22 bits)
Octal	0o17125700
Hexadecimal	0x3CABC0

Divisor Catalog (60 of 140)

1 2 3 4 6 8 9 12 13 16 18 24 26 27 32 36 39 48 52 54 59 64 72 78 81 96 104 108 117 118 144 156 162 177 192 208 216 234 236 288 312 324 351 354 416 432 468 472 531 576 624 648 702 708 767 832 864 936 944 1,053

Collatz Trajectory (66 steps to reach 1)

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

3,976,128 1,988,064 994,032 497,016 248,508 124,254 62,127 186,382 93,191 279,574 139,787 419,362 209,681 629,044 314,522 157,261 471,784 235,892 117,946 58,973 176,920 88,460 44,230 22,115 66,346 33,173 99,520 49,760 24,880 12,440 6,220 3,110 1,555 4,666 2,333 7,000 3,500 1,750 875 2,626 1,313 3,940 1,970 985 2,956 1,478 739 2,218 1,109 3,328 1,664 832 416 208 104 52 26 13 40 20

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,976,127 Browse Full Index Next Integer #3,976,129 →