2,010,632

2³ × 13 × 19333

2,010,632 factors as 2^3 × 13 × 19333. Its 16 positive divisors give a proper-divisor sum of 2,049,508, so this integer is abundant. The Collatz stopping time is 91 steps.

Prime Factor Structure

Factorization String 2^3 × 13 × 19333

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 4,060,140

Proper Divisor Sum 2,049,508

Digit Sum / Digital Root 14 (Root: 5)

Adjacent Primes #2010611 ← → #2010647

Radix Representation

Decimal	2010632
Binary	111101010111000001000 (21 bits)
Octal	0o7527010
Hexadecimal	0x1EAE08

Divisor Catalog (16)

1 2 4 8 13 26 52 104 19,333 38,666 77,332 154,664 251,329 502,658 1,005,316 2,010,632

Collatz Trajectory (91 steps to reach 1)

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

2,010,632 1,005,316 502,658 251,329 753,988 376,994 188,497 565,492 282,746 141,373 424,120 212,060 106,030 53,015 159,046 79,523 238,570 119,285 357,856 178,928 89,464 44,732 22,366 11,183 33,550 16,775 50,326 25,163 75,490 37,745 113,236 56,618 28,309 84,928 42,464 21,232 10,616 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,631 Browse Full Index Next Integer #2,010,633 →