2,805,322

2 × 13 × 107897

2,805,322 factors as 2 × 13 × 107897. Its 8 positive divisors give a proper-divisor sum of 1,726,394, so this integer is deficient. The Collatz stopping time is 169 steps.

Prime Factor Structure

Factorization String 2 × 13 × 107897

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 4,531,716

Proper Divisor Sum 1,726,394

Digit Sum / Digital Root 22 (Root: 4)

Adjacent Primes #2805311 ← → #2805353

Radix Representation

Decimal	2805322
Binary	1010101100111001001010 (22 bits)
Octal	0o12547112
Hexadecimal	0x2ACE4A

Divisor Catalog (8)

1 2 13 26 107,897 215,794 1,402,661 2,805,322

Collatz Trajectory (169 steps to reach 1)

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

2,805,322 1,402,661 4,207,984 2,103,992 1,051,996 525,998 262,999 788,998 394,499 1,183,498 591,749 1,775,248 887,624 443,812 221,906 110,953 332,860 166,430 83,215 249,646 124,823 374,470 187,235 561,706 280,853 842,560 421,280 210,640 105,320 52,660 26,330 13,165 39,496 19,748 9,874 4,937 14,812 7,406 3,703 11,110 5,555 16,666 8,333 25,000 12,500 6,250 3,125 9,376 4,688 2,344 1,172 586 293 880 440 220 110 55 166 83

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,805,321 Browse Full Index Next Integer #2,805,323 →