7,889,838

2 × 3 × 11 × 173 × 691

7,889,838 factors as 2 × 3 × 11 × 173 × 691. Its 32 positive divisors give a proper-divisor sum of 9,448,914, so this integer is abundant. The Collatz stopping time is 261 steps.

Prime Factor Structure

Factorization String 2 × 3 × 11 × 173 × 691

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 17,338,752

Proper Divisor Sum 9,448,914

Digit Sum / Digital Root 51 (Root: 6)

Adjacent Primes #7889837 ← → #7889863

Radix Representation

Decimal	7889838
Binary	11110000110001110101110 (23 bits)
Octal	0o36061656
Hexadecimal	0x7863AE

Divisor Catalog (32)

1 2 3 6 11 22 33 66 173 346 519 691 1,038 1,382 1,903 2,073 3,806 4,146 5,709 7,601 11,418 15,202 22,803 45,606 119,543 239,086 358,629 717,258 1,314,973 2,629,946 3,944,919 7,889,838

Collatz Trajectory (261 steps to reach 1)

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

7,889,838 3,944,919 11,834,758 5,917,379 17,752,138 8,876,069 26,628,208 13,314,104 6,657,052 3,328,526 1,664,263 4,992,790 2,496,395 7,489,186 3,744,593 11,233,780 5,616,890 2,808,445 8,425,336 4,212,668 2,106,334 1,053,167 3,159,502 1,579,751 4,739,254 2,369,627 7,108,882 3,554,441 10,663,324 5,331,662 2,665,831 7,997,494 3,998,747 11,996,242 5,998,121 17,994,364 8,997,182 4,498,591 13,495,774 6,747,887 20,243,662 10,121,831 30,365,494 15,182,747 45,548,242 22,774,121 68,322,364 34,161,182 17,080,591 51,241,774 25,620,887 76,862,662 38,431,331 115,293,994 57,646,997 172,940,992 86,470,496 43,235,248 21,617,624 10,808,812

← Previous Integer #7,889,837 Browse Full Index Next Integer #7,889,839 →