2,061,564

2² × 3 × 149 × 1153

2,061,564 factors as 2^2 × 3 × 149 × 1153. Its 24 positive divisors give a proper-divisor sum of 2,785,236, so this integer is abundant. The Collatz stopping time is 104 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 149 × 1153

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 4,846,800

Proper Divisor Sum 2,785,236

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #2061551 ← → #2061583

Radix Representation

Decimal	2061564
Binary	111110111010011111100 (21 bits)
Octal	0o7672374
Hexadecimal	0x1F74FC

Divisor Catalog (24)

1 2 3 4 6 12 149 298 447 596 894 1,153 1,788 2,306 3,459 4,612 6,918 13,836 171,797 343,594 515,391 687,188 1,030,782 2,061,564

Collatz Trajectory (104 steps to reach 1)

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

2,061,564 1,030,782 515,391 1,546,174 773,087 2,319,262 1,159,631 3,478,894 1,739,447 5,218,342 2,609,171 7,827,514 3,913,757 11,741,272 5,870,636 2,935,318 1,467,659 4,402,978 2,201,489 6,604,468 3,302,234 1,651,117 4,953,352 2,476,676 1,238,338 619,169 1,857,508 928,754 464,377 1,393,132 696,566 348,283 1,044,850 522,425 1,567,276 783,638 391,819 1,175,458 587,729 1,763,188 881,594 440,797 1,322,392 661,196 330,598 165,299 495,898 247,949 743,848 371,924 185,962 92,981 278,944 139,472 69,736 34,868 17,434 8,717 26,152 13,076

← Previous Integer #2,061,563 Browse Full Index Next Integer #2,061,565 →