2,975,550

2 × 3 × 5² × 83 × 239

2,975,550 factors as 2 × 3 × 5^2 × 83 × 239. Its 48 positive divisors give a proper-divisor sum of 4,523,970, so this integer is abundant. The Collatz stopping time is 120 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5^2 × 83 × 239

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 7,499,520

Proper Divisor Sum 4,523,970

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #2975543 ← → #2975569

Radix Representation

Decimal	2975550
Binary	1011010110011100111110 (22 bits)
Octal	0o13263476
Hexadecimal	0x2D673E

Divisor Catalog (48)

1 2 3 5 6 10 15 25 30 50 75 83 150 166 239 249 415 478 498 717 830 1,195 1,245 1,434 2,075 2,390 2,490 3,585 4,150 5,975 6,225 7,170 11,950 12,450 17,925 19,837 35,850 39,674 59,511 99,185 119,022 198,370 297,555 495,925 595,110 991,850 1,487,775 2,975,550

Collatz Trajectory (120 steps to reach 1)

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

2,975,550 1,487,775 4,463,326 2,231,663 6,694,990 3,347,495 10,042,486 5,021,243 15,063,730 7,531,865 22,595,596 11,297,798 5,648,899 16,946,698 8,473,349 25,420,048 12,710,024 6,355,012 3,177,506 1,588,753 4,766,260 2,383,130 1,191,565 3,574,696 1,787,348 893,674 446,837 1,340,512 670,256 335,128 167,564 83,782 41,891 125,674 62,837 188,512 94,256 47,128 23,564 11,782 5,891 17,674 8,837 26,512 13,256 6,628 3,314 1,657 4,972 2,486 1,243 3,730 1,865 5,596 2,798 1,399 4,198 2,099 6,298 3,149

← Previous Integer #2,975,549 Browse Full Index Next Integer #2,975,551 →