791,556

2² × 3 × 65963

791,556 factors as 2^2 × 3 × 65963. Its 12 positive divisors give a proper-divisor sum of 1,055,436, so this integer is abundant. The Collatz stopping time is 162 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 65963

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 1,846,992

Proper Divisor Sum 1,055,436

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #791543 ← → #791561

Radix Representation

Decimal	791556
Binary	11000001010000000100 (20 bits)
Octal	0o3012004
Hexadecimal	0xC1404

Divisor Catalog (12)

1 2 3 4 6 12 65,963 131,926 197,889 263,852 395,778 791,556

Collatz Trajectory (162 steps to reach 1)

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

791,556 395,778 197,889 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 47 142

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #791,555 Browse Full Index Next Integer #791,557 →