4,029,486

2 × 3 × 671581

4,029,486 factors as 2 × 3 × 671581. Its 8 positive divisors give a proper-divisor sum of 4,029,498, so this integer is abundant. The Collatz stopping time is 216 steps.

Prime Factor Structure

Factorization String 2 × 3 × 671581

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 8,058,984

Proper Divisor Sum 4,029,498

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #4029479 ← → #4029497

Radix Representation

Decimal	4029486
Binary	1111010111110000101110 (22 bits)
Octal	0o17276056
Hexadecimal	0x3D7C2E

Divisor Catalog (8)

1 2 3 6 671,581 1,343,162 2,014,743 4,029,486

Collatz Trajectory (216 steps to reach 1)

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

4,029,486 2,014,743 6,044,230 3,022,115 9,066,346 4,533,173 13,599,520 6,799,760 3,399,880 1,699,940 849,970 424,985 1,274,956 637,478 318,739 956,218 478,109 1,434,328 717,164 358,582 179,291 537,874 268,937 806,812 403,406 201,703 605,110 302,555 907,666 453,833 1,361,500 680,750 340,375 1,021,126 510,563 1,531,690 765,845 2,297,536 1,148,768 574,384 287,192 143,596 71,798 35,899 107,698 53,849 161,548 80,774 40,387 121,162 60,581 181,744 90,872 45,436 22,718 11,359 34,078 17,039 51,118 25,559

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,029,485 Browse Full Index Next Integer #4,029,487 →