5,224,578

2 × 3 × 433 × 2011

5,224,578 factors as 2 × 3 × 433 × 2011. Its 16 positive divisors give a proper-divisor sum of 5,253,918, so this integer is abundant. The Collatz stopping time is 219 steps.

Prime Factor Structure

Factorization String 2 × 3 × 433 × 2011

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 10,478,496

Proper Divisor Sum 5,253,918

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #5224577 ← → #5224579

Radix Representation

Decimal	5224578
Binary	10011111011100010000010 (23 bits)
Octal	0o23734202
Hexadecimal	0x4FB882

Divisor Catalog (16)

1 2 3 6 433 866 1,299 2,011 2,598 4,022 6,033 12,066 870,763 1,741,526 2,612,289 5,224,578

Collatz Trajectory (219 steps to reach 1)

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

5,224,578 2,612,289 7,836,868 3,918,434 1,959,217 5,877,652 2,938,826 1,469,413 4,408,240 2,204,120 1,102,060 551,030 275,515 826,546 413,273 1,239,820 619,910 309,955 929,866 464,933 1,394,800 697,400 348,700 174,350 87,175 261,526 130,763 392,290 196,145 588,436 294,218 147,109 441,328 220,664 110,332 55,166 27,583 82,750 41,375 124,126 62,063 186,190 93,095 279,286 139,643 418,930 209,465 628,396 314,198 157,099 471,298 235,649 706,948 353,474 176,737 530,212 265,106 132,553 397,660 198,830

← Previous Integer #5,224,577 Browse Full Index Next Integer #5,224,579 →