2,637,740

2² × 5 × 7 × 83 × 227

2,637,740 factors as 2^2 × 5 × 7 × 83 × 227. Its 48 positive divisors give a proper-divisor sum of 3,797,332, so this integer is abundant. The Collatz stopping time is 99 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 7 × 83 × 227

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 6,435,072

Proper Divisor Sum 3,797,332

Digit Sum / Digital Root 29 (Root: 2)

Adjacent Primes #2637707 ← → #2637743

Radix Representation

Decimal	2637740
Binary	1010000011111110101100 (22 bits)
Octal	0o12037654
Hexadecimal	0x283FAC

Divisor Catalog (48)

1 2 4 5 7 10 14 20 28 35 70 83 140 166 227 332 415 454 581 830 908 1,135 1,162 1,589 1,660 2,270 2,324 2,905 3,178 4,540 5,810 6,356 7,945 11,620 15,890 18,841 31,780 37,682 75,364 94,205 131,887 188,410 263,774 376,820 527,548 659,435 1,318,870 2,637,740

Collatz Trajectory (99 steps to reach 1)

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

2,637,740 1,318,870 659,435 1,978,306 989,153 2,967,460 1,483,730 741,865 2,225,596 1,112,798 556,399 1,669,198 834,599 2,503,798 1,251,899 3,755,698 1,877,849 5,633,548 2,816,774 1,408,387 4,225,162 2,112,581 6,337,744 3,168,872 1,584,436 792,218 396,109 1,188,328 594,164 297,082 148,541 445,624 222,812 111,406 55,703 167,110 83,555 250,666 125,333 376,000 188,000 94,000 47,000 23,500 11,750 5,875 17,626 8,813 26,440 13,220 6,610 3,305 9,916 4,958 2,479 7,438 3,719 11,158 5,579 16,738

← Previous Integer #2,637,739 Browse Full Index Next Integer #2,637,741 →