2,926,900

2² × 5² × 29269

2,926,900 factors as 2^2 × 5^2 × 29269. Its 18 positive divisors give a proper-divisor sum of 3,424,690, so this integer is abundant. The Collatz stopping time is 138 steps.

Prime Factor Structure

Factorization String 2^2 × 5^2 × 29269

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 18

Divisor Sum (σ) 6,351,590

Proper Divisor Sum 3,424,690

Digit Sum / Digital Root 28 (Root: 1)

Adjacent Primes #2926897 ← → #2926909

Radix Representation

Decimal	2926900
Binary	1011001010100100110100 (22 bits)
Octal	0o13124464
Hexadecimal	0x2CA934

Divisor Catalog (18)

1 2 4 5 10 20 25 50 100 29,269 58,538 117,076 146,345 292,690 585,380 731,725 1,463,450 2,926,900

Collatz Trajectory (138 steps to reach 1)

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

2,926,900 1,463,450 731,725 2,195,176 1,097,588 548,794 274,397 823,192 411,596 205,798 102,899 308,698 154,349 463,048 231,524 115,762 57,881 173,644 86,822 43,411 130,234 65,117 195,352 97,676 48,838 24,419 73,258 36,629 109,888 54,944 27,472 13,736 6,868 3,434 1,717 5,152 2,576 1,288 644 322 161 484 242 121 364 182 91 274 137 412 206 103 310 155 466 233 700 350 175 526

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,926,899 Browse Full Index Next Integer #2,926,901 →