2,020,758

2 × 3 × 336793

2,020,758 factors as 2 × 3 × 336793. Its 8 positive divisors give a proper-divisor sum of 2,020,770, so this integer is abundant. The Collatz stopping time is 91 steps.

Prime Factor Structure

Factorization String 2 × 3 × 336793

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 4,041,528

Proper Divisor Sum 2,020,770

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #2020729 ← → #2020771

Radix Representation

Decimal	2020758
Binary	111101101010110010110 (21 bits)
Octal	0o7552626
Hexadecimal	0x1ED596

Divisor Catalog (8)

1 2 3 6 336,793 673,586 1,010,379 2,020,758

Collatz Trajectory (91 steps to reach 1)

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

2,020,758 1,010,379 3,031,138 1,515,569 4,546,708 2,273,354 1,136,677 3,410,032 1,705,016 852,508 426,254 213,127 639,382 319,691 959,074 479,537 1,438,612 719,306 359,653 1,078,960 539,480 269,740 134,870 67,435 202,306 101,153 303,460 151,730 75,865 227,596 113,798 56,899 170,698 85,349 256,048 128,024 64,012 32,006 16,003 48,010 24,005 72,016 36,008 18,004 9,002 4,501 13,504 6,752 3,376 1,688 844 422 211 634 317 952 476 238 119 358

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,020,757 Browse Full Index Next Integer #2,020,759 →