3,972,066

2 × 3 × 7 × 94573

3,972,066 factors as 2 × 3 × 7 × 94573. Its 16 positive divisors give a proper-divisor sum of 5,107,038, so this integer is abundant. The Collatz stopping time is 185 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 94573

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 9,079,104

Proper Divisor Sum 5,107,038

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #3972037 ← → #3972071

Radix Representation

Decimal	3972066
Binary	1111001001101111100010 (22 bits)
Octal	0o17115742
Hexadecimal	0x3C9BE2

Divisor Catalog (16)

1 2 3 6 7 14 21 42 94,573 189,146 283,719 567,438 662,011 1,324,022 1,986,033 3,972,066

Collatz Trajectory (185 steps to reach 1)

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

3,972,066 1,986,033 5,958,100 2,979,050 1,489,525 4,468,576 2,234,288 1,117,144 558,572 279,286 139,643 418,930 209,465 628,396 314,198 157,099 471,298 235,649 706,948 353,474 176,737 530,212 265,106 132,553 397,660 198,830 99,415 298,246 149,123 447,370 223,685 671,056 335,528 167,764 83,882 41,941 125,824 62,912 31,456 15,728 7,864 3,932 1,966 983 2,950 1,475 4,426 2,213 6,640 3,320 1,660 830 415 1,246 623 1,870 935 2,806 1,403 4,210

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,972,065 Browse Full Index Next Integer #3,972,067 →