2,010,232

2³ × 7 × 35897

2,010,232 factors as 2^3 × 7 × 35897. Its 16 positive divisors give a proper-divisor sum of 2,297,528, so this integer is abundant. The Collatz stopping time is 91 steps.

Prime Factor Structure

Factorization String 2^3 × 7 × 35897

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 4,307,760

Proper Divisor Sum 2,297,528

Digit Sum / Digital Root 10 (Root: 1)

Adjacent Primes #2010227 ← → #2010241

Radix Representation

Decimal	2010232
Binary	111101010110001111000 (21 bits)
Octal	0o7526170
Hexadecimal	0x1EAC78

Divisor Catalog (16)

1 2 4 7 8 14 28 56 35,897 71,794 143,588 251,279 287,176 502,558 1,005,116 2,010,232

Collatz Trajectory (91 steps to reach 1)

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

2,010,232 1,005,116 502,558 251,279 753,838 376,919 1,130,758 565,379 1,696,138 848,069 2,544,208 1,272,104 636,052 318,026 159,013 477,040 238,520 119,260 59,630 29,815 89,446 44,723 134,170 67,085 201,256 100,628 50,314 25,157 75,472 37,736 18,868 9,434 4,717 14,152 7,076 3,538 1,769 5,308 2,654 1,327 3,982 1,991 5,974 2,987 8,962 4,481 13,444 6,722 3,361 10,084 5,042 2,521 7,564 3,782 1,891 5,674 2,837 8,512 4,256 2,128

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,010,231 Browse Full Index Next Integer #2,010,233 →