7,886,896

2⁴ × 31 × 15901

7,886,896 factors as 2^4 × 31 × 15901. Its 20 positive divisors give a proper-divisor sum of 7,887,888, so this integer is abundant. The Collatz stopping time is 155 steps.

Prime Factor Structure

Factorization String 2^4 × 31 × 15901

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 15,774,784

Proper Divisor Sum 7,887,888

Digit Sum / Digital Root 52 (Root: 7)

Adjacent Primes #7886867 ← → #7886899

Radix Representation

Decimal	7886896
Binary	11110000101100000110000 (23 bits)
Octal	0o36054060
Hexadecimal	0x785830

Divisor Catalog (20)

1 2 4 8 16 31 62 124 248 496 15,901 31,802 63,604 127,208 254,416 492,931 985,862 1,971,724 3,943,448 7,886,896

Collatz Trajectory (155 steps to reach 1)

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

7,886,896 3,943,448 1,971,724 985,862 492,931 1,478,794 739,397 2,218,192 1,109,096 554,548 277,274 138,637 415,912 207,956 103,978 51,989 155,968 77,984 38,992 19,496 9,748 4,874 2,437 7,312 3,656 1,828 914 457 1,372 686 343 1,030 515 1,546 773 2,320 1,160 580 290 145 436 218 109 328 164 82 41 124 62 31 94 47 142 71 214 107 322 161 484 242

← Previous Integer #7,886,895 Browse Full Index Next Integer #7,886,897 →