2,404,962

2 × 3² × 7 × 19087

2,404,962 factors as 2 × 3^2 × 7 × 19087. Its 24 positive divisors give a proper-divisor sum of 3,550,494, so this integer is abundant. The Collatz stopping time is 73 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 7 × 19087

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 5,955,456

Proper Divisor Sum 3,550,494

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #2404957 ← → #2404991

Radix Representation

Decimal	2404962
Binary	1001001011001001100010 (22 bits)
Octal	0o11131142
Hexadecimal	0x24B262

Divisor Catalog (24)

Collatz Trajectory (73 steps to reach 1)

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

2,404,962 1,202,481 3,607,444 1,803,722 901,861 2,705,584 1,352,792 676,396 338,198 169,099 507,298 253,649 760,948 380,474 190,237 570,712 285,356 142,678 71,339 214,018 107,009 321,028 160,514 80,257 240,772 120,386 60,193 180,580 90,290 45,145 135,436 67,718 33,859 101,578 50,789 152,368 76,184 38,092 19,046 9,523 28,570 14,285 42,856 21,428 10,714 5,357 16,072 8,036 4,018 2,009 6,028 3,014 1,507 4,522 2,261 6,784 3,392 1,696 848 424

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,404,961 Browse Full Index Next Integer #2,404,963 →