4,043,328

2⁶ × 3 × 21059

4,043,328 factors as 2^6 × 3 × 21059. Its 28 positive divisors give a proper-divisor sum of 6,655,152, so this integer is abundant. The Collatz stopping time is 84 steps.

Prime Factor Structure

Factorization String 2^6 × 3 × 21059

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 28

Divisor Sum (σ) 10,698,480

Proper Divisor Sum 6,655,152

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #4043321 ← → #4043341

Radix Representation

Decimal	4043328
Binary	1111011011001001000000 (22 bits)
Octal	0o17331100
Hexadecimal	0x3DB240

Divisor Catalog (28)

Collatz Trajectory (84 steps to reach 1)

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

4,043,328 2,021,664 1,010,832 505,416 252,708 126,354 63,177 189,532 94,766 47,383 142,150 71,075 213,226 106,613 319,840 159,920 79,960 39,980 19,990 9,995 29,986 14,993 44,980 22,490 11,245 33,736 16,868 8,434 4,217 12,652 6,326 3,163 9,490 4,745 14,236 7,118 3,559 10,678 5,339 16,018 8,009 24,028 12,014 6,007 18,022 9,011 27,034 13,517 40,552 20,276 10,138 5,069 15,208 7,604 3,802 1,901 5,704 2,852 1,426 713

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,043,327 Browse Full Index Next Integer #4,043,329 →