9,896,052

2² × 3 × 824671

9,896,052 factors as 2^2 × 3 × 824671. Its 12 positive divisors give a proper-divisor sum of 13,194,764, so this integer is abundant. The Collatz stopping time is 207 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 824671

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 23,090,816

Proper Divisor Sum 13,194,764

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #9896041 ← → #9896053

Radix Representation

Decimal	9896052
Binary	100101110000000001110100 (24 bits)
Octal	0o45600164
Hexadecimal	0x970074

Divisor Catalog (12)

1 2 3 4 6 12 824,671 1,649,342 2,474,013 3,298,684 4,948,026 9,896,052

Collatz Trajectory (207 steps to reach 1)

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

9,896,052 4,948,026 2,474,013 7,422,040 3,711,020 1,855,510 927,755 2,783,266 1,391,633 4,174,900 2,087,450 1,043,725 3,131,176 1,565,588 782,794 391,397 1,174,192 587,096 293,548 146,774 73,387 220,162 110,081 330,244 165,122 82,561 247,684 123,842 61,921 185,764 92,882 46,441 139,324 69,662 34,831 104,494 52,247 156,742 78,371 235,114 117,557 352,672 176,336 88,168 44,084 22,042 11,021 33,064 16,532 8,266 4,133 12,400 6,200 3,100 1,550 775 2,326 1,163 3,490 1,745

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #9,896,051 Browse Full Index Next Integer #9,896,053 →