5,001,828

2² × 3 × 13 × 32063

5,001,828 factors as 2^2 × 3 × 13 × 32063. Its 24 positive divisors give a proper-divisor sum of 7,567,260, so this integer is abundant. The Collatz stopping time is 175 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 13 × 32063

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 12,569,088

Proper Divisor Sum 7,567,260

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #5001809 ← → #5001907

Radix Representation

Decimal	5001828
Binary	10011000101001001100100 (23 bits)
Octal	0o23051144
Hexadecimal	0x4C5264

Divisor Catalog (24)

1 2 3 4 6 12 13 26 39 52 78 156 32,063 64,126 96,189 128,252 192,378 384,756 416,819 833,638 1,250,457 1,667,276 2,500,914 5,001,828

Collatz Trajectory (175 steps to reach 1)

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

5,001,828 2,500,914 1,250,457 3,751,372 1,875,686 937,843 2,813,530 1,406,765 4,220,296 2,110,148 1,055,074 527,537 1,582,612 791,306 395,653 1,186,960 593,480 296,740 148,370 74,185 222,556 111,278 55,639 166,918 83,459 250,378 125,189 375,568 187,784 93,892 46,946 23,473 70,420 35,210 17,605 52,816 26,408 13,204 6,602 3,301 9,904 4,952 2,476 1,238 619 1,858 929 2,788 1,394 697 2,092 1,046 523 1,570 785 2,356 1,178 589 1,768 884

← Previous Integer #5,001,827 Browse Full Index Next Integer #5,001,829 →