8,940,972

2² × 3 × 331 × 2251

8,940,972 factors as 2^2 × 3 × 331 × 2251. Its 24 positive divisors give a proper-divisor sum of 11,993,620, so this integer is abundant. The Collatz stopping time is 88 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 331 × 2251

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 20,934,592

Proper Divisor Sum 11,993,620

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #8940931 ← → #8940973

Radix Representation

Decimal	8940972
Binary	100010000110110110101100 (24 bits)
Octal	0o42066654
Hexadecimal	0x886DAC

Divisor Catalog (24)

Collatz Trajectory (88 steps to reach 1)

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

8,940,972 4,470,486 2,235,243 6,705,730 3,352,865 10,058,596 5,029,298 2,514,649 7,543,948 3,771,974 1,885,987 5,657,962 2,828,981 8,486,944 4,243,472 2,121,736 1,060,868 530,434 265,217 795,652 397,826 198,913 596,740 298,370 149,185 447,556 223,778 111,889 335,668 167,834 83,917 251,752 125,876 62,938 31,469 94,408 47,204 23,602 11,801 35,404 17,702 8,851 26,554 13,277 39,832 19,916 9,958 4,979 14,938 7,469 22,408 11,204 5,602 2,801 8,404 4,202 2,101 6,304 3,152 1,576

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #8,940,971 Browse Full Index Next Integer #8,940,973 →