2,013,564

2² × 3 × 7 × 23971

2,013,564 factors as 2^2 × 3 × 7 × 23971. Its 24 positive divisors give a proper-divisor sum of 3,356,164, so this integer is abundant. The Collatz stopping time is 91 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 7 × 23971

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 5,369,728

Proper Divisor Sum 3,356,164

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #2013553 ← → #2013589

Radix Representation

Decimal	2013564
Binary	111101011100101111100 (21 bits)
Octal	0o7534574
Hexadecimal	0x1EB97C

Divisor Catalog (24)

Collatz Trajectory (91 steps to reach 1)

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

2,013,564 1,006,782 503,391 1,510,174 755,087 2,265,262 1,132,631 3,397,894 1,698,947 5,096,842 2,548,421 7,645,264 3,822,632 1,911,316 955,658 477,829 1,433,488 716,744 358,372 179,186 89,593 268,780 134,390 67,195 201,586 100,793 302,380 151,190 75,595 226,786 113,393 340,180 170,090 85,045 255,136 127,568 63,784 31,892 15,946 7,973 23,920 11,960 5,980 2,990 1,495 4,486 2,243 6,730 3,365 10,096 5,048 2,524 1,262 631 1,894 947 2,842 1,421 4,264 2,132

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

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