7,842,822

2 × 3 × 13 × 100549

7,842,822 factors as 2 × 3 × 13 × 100549. Its 16 positive divisors give a proper-divisor sum of 9,049,578, so this integer is abundant. The Collatz stopping time is 80 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13 × 100549

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 16,892,400

Proper Divisor Sum 9,049,578

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #7842803 ← → #7842823

Radix Representation

Decimal	7842822
Binary	11101111010110000000110 (23 bits)
Octal	0o35726006
Hexadecimal	0x77AC06

Divisor Catalog (16)

1 2 3 6 13 26 39 78 100,549 201,098 301,647 603,294 1,307,137 2,614,274 3,921,411 7,842,822

Collatz Trajectory (80 steps to reach 1)

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

7,842,822 3,921,411 11,764,234 5,882,117 17,646,352 8,823,176 4,411,588 2,205,794 1,102,897 3,308,692 1,654,346 827,173 2,481,520 1,240,760 620,380 310,190 155,095 465,286 232,643 697,930 348,965 1,046,896 523,448 261,724 130,862 65,431 196,294 98,147 294,442 147,221 441,664 220,832 110,416 55,208 27,604 13,802 6,901 20,704 10,352 5,176 2,588 1,294 647 1,942 971 2,914 1,457 4,372 2,186 1,093 3,280 1,640 820 410 205 616 308 154 77 232

← Previous Integer #7,842,821 Browse Full Index Next Integer #7,842,823 →