3,166,228

2² × 13 × 60889

3,166,228 factors as 2^2 × 13 × 60889. Its 12 positive divisors give a proper-divisor sum of 2,800,992, so this integer is deficient. The Collatz stopping time is 164 steps.

Prime Factor Structure

Factorization String 2^2 × 13 × 60889

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 5,967,220

Proper Divisor Sum 2,800,992

Digit Sum / Digital Root 28 (Root: 1)

Adjacent Primes #3166223 ← → #3166231

Radix Representation

Decimal	3166228
Binary	1100000101000000010100 (22 bits)
Octal	0o14050024
Hexadecimal	0x305014

Divisor Catalog (12)

1 2 4 13 26 52 60,889 121,778 243,556 791,557 1,583,114 3,166,228

Collatz Trajectory (164 steps to reach 1)

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

3,166,228 1,583,114 791,557 2,374,672 1,187,336 593,668 296,834 148,417 445,252 222,626 111,313 333,940 166,970 83,485 250,456 125,228 62,614 31,307 93,922 46,961 140,884 70,442 35,221 105,664 52,832 26,416 13,208 6,604 3,302 1,651 4,954 2,477 7,432 3,716 1,858 929 2,788 1,394 697 2,092 1,046 523 1,570 785 2,356 1,178 589 1,768 884 442 221 664 332 166 83 250 125 376 188 94

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,166,227 Browse Full Index Next Integer #3,166,229 →