3,553,572

2² × 3 × 11 × 26921

3,553,572 factors as 2^2 × 3 × 11 × 26921. Its 24 positive divisors give a proper-divisor sum of 5,492,220, so this integer is abundant. The Collatz stopping time is 146 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 11 × 26921

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 9,045,792

Proper Divisor Sum 5,492,220

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3553559 ← → #3553579

Radix Representation

Decimal	3553572
Binary	1101100011100100100100 (22 bits)
Octal	0o15434444
Hexadecimal	0x363924

Divisor Catalog (24)

Collatz Trajectory (146 steps to reach 1)

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

3,553,572 1,776,786 888,393 2,665,180 1,332,590 666,295 1,998,886 999,443 2,998,330 1,499,165 4,497,496 2,248,748 1,124,374 562,187 1,686,562 843,281 2,529,844 1,264,922 632,461 1,897,384 948,692 474,346 237,173 711,520 355,760 177,880 88,940 44,470 22,235 66,706 33,353 100,060 50,030 25,015 75,046 37,523 112,570 56,285 168,856 84,428 42,214 21,107 63,322 31,661 94,984 47,492 23,746 11,873 35,620 17,810 8,905 26,716 13,358 6,679 20,038 10,019 30,058 15,029 45,088 22,544

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,553,571 Browse Full Index Next Integer #3,553,573 →