2,016,680

2³ × 5 × 50417

2,016,680 factors as 2^3 × 5 × 50417. Its 16 positive divisors give a proper-divisor sum of 2,520,940, so this integer is abundant. The Collatz stopping time is 135 steps.

Prime Factor Structure

Factorization String 2^3 × 5 × 50417

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 4,537,620

Proper Divisor Sum 2,520,940

Digit Sum / Digital Root 23 (Root: 5)

Adjacent Primes #2016673 ← → #2016691

Radix Representation

Decimal	2016680
Binary	111101100010110101000 (21 bits)
Octal	0o7542650
Hexadecimal	0x1EC5A8

Divisor Catalog (16)

1 2 4 5 8 10 20 40 50,417 100,834 201,668 252,085 403,336 504,170 1,008,340 2,016,680

Collatz Trajectory (135 steps to reach 1)

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

2,016,680 1,008,340 504,170 252,085 756,256 378,128 189,064 94,532 47,266 23,633 70,900 35,450 17,725 53,176 26,588 13,294 6,647 19,942 9,971 29,914 14,957 44,872 22,436 11,218 5,609 16,828 8,414 4,207 12,622 6,311 18,934 9,467 28,402 14,201 42,604 21,302 10,651 31,954 15,977 47,932 23,966 11,983 35,950 17,975 53,926 26,963 80,890 40,445 121,336 60,668 30,334 15,167 45,502 22,751 68,254 34,127 102,382 51,191 153,574 76,787

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,016,679 Browse Full Index Next Integer #2,016,681 →