9,780,932

2² × 7 × 271 × 1289

9,780,932 factors as 2^2 × 7 × 271 × 1289. Its 24 positive divisors give a proper-divisor sum of 9,868,348, so this integer is abundant. The Collatz stopping time is 70 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 271 × 1289

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 19,649,280

Proper Divisor Sum 9,868,348

Digit Sum / Digital Root 38 (Root: 2)

Adjacent Primes #9780931 ← → #9780971

Radix Representation

Decimal	9780932
Binary	100101010011111011000100 (24 bits)
Octal	0o45237304
Hexadecimal	0x953EC4

Divisor Catalog (24)

Collatz Trajectory (70 steps to reach 1)

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

9,780,932 4,890,466 2,445,233 7,335,700 3,667,850 1,833,925 5,501,776 2,750,888 1,375,444 687,722 343,861 1,031,584 515,792 257,896 128,948 64,474 32,237 96,712 48,356 24,178 12,089 36,268 18,134 9,067 27,202 13,601 40,804 20,402 10,201 30,604 15,302 7,651 22,954 11,477 34,432 17,216 8,608 4,304 2,152 1,076 538 269 808 404 202 101 304 152 76 38 19 58 29 88 44 22 11 34 17 52

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #9,780,931 Browse Full Index Next Integer #9,780,933 →