2,008,266

2 × 3 × 13 × 25747

2,008,266 factors as 2 × 3 × 13 × 25747. Its 16 positive divisors give a proper-divisor sum of 2,317,398, so this integer is abundant. The Collatz stopping time is 153 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13 × 25747

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 4,325,664

Proper Divisor Sum 2,317,398

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #2008247 ← → #2008271

Radix Representation

Decimal	2008266
Binary	111101010010011001010 (21 bits)
Octal	0o7522312
Hexadecimal	0x1EA4CA

Divisor Catalog (16)

1 2 3 6 13 26 39 78 25,747 51,494 77,241 154,482 334,711 669,422 1,004,133 2,008,266

Collatz Trajectory (153 steps to reach 1)

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

2,008,266 1,004,133 3,012,400 1,506,200 753,100 376,550 188,275 564,826 282,413 847,240 423,620 211,810 105,905 317,716 158,858 79,429 238,288 119,144 59,572 29,786 14,893 44,680 22,340 11,170 5,585 16,756 8,378 4,189 12,568 6,284 3,142 1,571 4,714 2,357 7,072 3,536 1,768 884 442 221 664 332 166 83 250 125 376 188 94 47 142 71 214 107 322 161 484 242 121 364

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,008,265 Browse Full Index Next Integer #2,008,267 →