2,209,482

2 × 3² × 11 × 11159

2,209,482 factors as 2 × 3^2 × 11 × 11159. Its 24 positive divisors give a proper-divisor sum of 3,013,398, so this integer is abundant. The Collatz stopping time is 73 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 11 × 11159

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 5,222,880

Proper Divisor Sum 3,013,398

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #2209457 ← → #2209483

Radix Representation

Decimal	2209482
Binary	1000011011011011001010 (22 bits)
Octal	0o10333312
Hexadecimal	0x21B6CA

Divisor Catalog (24)

Collatz Trajectory (73 steps to reach 1)

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

2,209,482 1,104,741 3,314,224 1,657,112 828,556 414,278 207,139 621,418 310,709 932,128 466,064 233,032 116,516 58,258 29,129 87,388 43,694 21,847 65,542 32,771 98,314 49,157 147,472 73,736 36,868 18,434 9,217 27,652 13,826 6,913 20,740 10,370 5,185 15,556 7,778 3,889 11,668 5,834 2,917 8,752 4,376 2,188 1,094 547 1,642 821 2,464 1,232 616 308 154 77 232 116 58 29 88 44 22 11

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,209,481 Browse Full Index Next Integer #2,209,483 →