2,441,436

2² × 3 × 31 × 6563

2,441,436 factors as 2^2 × 3 × 31 × 6563. Its 24 positive divisors give a proper-divisor sum of 3,439,908, so this integer is abundant. The Collatz stopping time is 60 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 31 × 6563

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 5,881,344

Proper Divisor Sum 3,439,908

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #2441431 ← → #2441437

Radix Representation

Decimal	2441436
Binary	1001010100000011011100 (22 bits)
Octal	0o11240334
Hexadecimal	0x2540DC

Divisor Catalog (24)

Collatz Trajectory (60 steps to reach 1)

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

2,441,436 1,220,718 610,359 1,831,078 915,539 2,746,618 1,373,309 4,119,928 2,059,964 1,029,982 514,991 1,544,974 772,487 2,317,462 1,158,731 3,476,194 1,738,097 5,214,292 2,607,146 1,303,573 3,910,720 1,955,360 977,680 488,840 244,420 122,210 61,105 183,316 91,658 45,829 137,488 68,744 34,372 17,186 8,593 25,780 12,890 6,445 19,336 9,668 4,834 2,417 7,252 3,626 1,813 5,440 2,720 1,360 680 340 170 85 256 128 64 32 16 8 4 2

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,441,435 Browse Full Index Next Integer #2,441,437 →