7,943,592

2³ × 3 × 330983

7,943,592 factors as 2^3 × 3 × 330983. Its 16 positive divisors give a proper-divisor sum of 11,915,448, so this integer is abundant. The Collatz stopping time is 155 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 330983

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 19,859,040

Proper Divisor Sum 11,915,448

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #7943591 ← → #7943597

Radix Representation

Decimal	7943592
Binary	11110010011010110101000 (23 bits)
Octal	0o36232650
Hexadecimal	0x7935A8

Divisor Catalog (16)

1 2 3 4 6 8 12 24 330,983 661,966 992,949 1,323,932 1,985,898 2,647,864 3,971,796 7,943,592

Collatz Trajectory (155 steps to reach 1)

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

7,943,592 3,971,796 1,985,898 992,949 2,978,848 1,489,424 744,712 372,356 186,178 93,089 279,268 139,634 69,817 209,452 104,726 52,363 157,090 78,545 235,636 117,818 58,909 176,728 88,364 44,182 22,091 66,274 33,137 99,412 49,706 24,853 74,560 37,280 18,640 9,320 4,660 2,330 1,165 3,496 1,748 874 437 1,312 656 328 164 82 41 124 62 31 94 47 142 71 214 107 322 161 484 242

← Previous Integer #7,943,591 Browse Full Index Next Integer #7,943,593 →