4,498,026

2 × 3 × 13 × 57667

4,498,026 factors as 2 × 3 × 13 × 57667. Its 16 positive divisors give a proper-divisor sum of 5,190,198, so this integer is abundant. The Collatz stopping time is 180 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13 × 57667

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 9,688,224

Proper Divisor Sum 5,190,198

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #4498009 ← → #4498027

Radix Representation

Decimal	4498026
Binary	10001001010001001101010 (23 bits)
Octal	0o21121152
Hexadecimal	0x44A26A

Divisor Catalog (16)

1 2 3 6 13 26 39 78 57,667 115,334 173,001 346,002 749,671 1,499,342 2,249,013 4,498,026

Collatz Trajectory (180 steps to reach 1)

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

4,498,026 2,249,013 6,747,040 3,373,520 1,686,760 843,380 421,690 210,845 632,536 316,268 158,134 79,067 237,202 118,601 355,804 177,902 88,951 266,854 133,427 400,282 200,141 600,424 300,212 150,106 75,053 225,160 112,580 56,290 28,145 84,436 42,218 21,109 63,328 31,664 15,832 7,916 3,958 1,979 5,938 2,969 8,908 4,454 2,227 6,682 3,341 10,024 5,012 2,506 1,253 3,760 1,880 940 470 235 706 353 1,060 530 265 796

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,498,025 Browse Full Index Next Integer #4,498,027 →