5,551,068

2² × 3 × 462589

5,551,068 factors as 2^2 × 3 × 462589. Its 12 positive divisors give a proper-divisor sum of 7,401,452, so this integer is abundant. The Collatz stopping time is 139 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 462589

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 12,952,520

Proper Divisor Sum 7,401,452

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #5551057 ← → #5551069

Radix Representation

Decimal	5551068
Binary	10101001011001111011100 (23 bits)
Octal	0o25131734
Hexadecimal	0x54B3DC

Divisor Catalog (12)

1 2 3 4 6 12 462,589 925,178 1,387,767 1,850,356 2,775,534 5,551,068

Collatz Trajectory (139 steps to reach 1)

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

5,551,068 2,775,534 1,387,767 4,163,302 2,081,651 6,244,954 3,122,477 9,367,432 4,683,716 2,341,858 1,170,929 3,512,788 1,756,394 878,197 2,634,592 1,317,296 658,648 329,324 164,662 82,331 246,994 123,497 370,492 185,246 92,623 277,870 138,935 416,806 208,403 625,210 312,605 937,816 468,908 234,454 117,227 351,682 175,841 527,524 263,762 131,881 395,644 197,822 98,911 296,734 148,367 445,102 222,551 667,654 333,827 1,001,482 500,741 1,502,224 751,112 375,556 187,778 93,889 281,668 140,834 70,417 211,252

← Previous Integer #5,551,067 Browse Full Index Next Integer #5,551,069 →