3,002,450

2 × 5² × 11 × 53 × 103

3,002,450 factors as 2 × 5^2 × 11 × 53 × 103. Its 48 positive divisors give a proper-divisor sum of 3,265,006, so this integer is abundant. The Collatz stopping time is 164 steps.

Prime Factor Structure

Factorization String 2 × 5^2 × 11 × 53 × 103

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 6,267,456

Proper Divisor Sum 3,265,006

Digit Sum / Digital Root 14 (Root: 5)

Adjacent Primes #3002449 ← → #3002453

Radix Representation

Decimal	3002450
Binary	1011011101000001010010 (22 bits)
Octal	0o13350122
Hexadecimal	0x2DD052

Divisor Catalog (48)

1 2 5 10 11 22 25 50 53 55 103 106 110 206 265 275 515 530 550 583 1,030 1,133 1,166 1,325 2,266 2,575 2,650 2,915 5,150 5,459 5,665 5,830 10,918 11,330 14,575 27,295 28,325 29,150 54,590 56,650 60,049 120,098 136,475 272,950 300,245 600,490 1,501,225 3,002,450

Collatz Trajectory (164 steps to reach 1)

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

3,002,450 1,501,225 4,503,676 2,251,838 1,125,919 3,377,758 1,688,879 5,066,638 2,533,319 7,599,958 3,799,979 11,399,938 5,699,969 17,099,908 8,549,954 4,274,977 12,824,932 6,412,466 3,206,233 9,618,700 4,809,350 2,404,675 7,214,026 3,607,013 10,821,040 5,410,520 2,705,260 1,352,630 676,315 2,028,946 1,014,473 3,043,420 1,521,710 760,855 2,282,566 1,141,283 3,423,850 1,711,925 5,135,776 2,567,888 1,283,944 641,972 320,986 160,493 481,480 240,740 120,370 60,185 180,556 90,278 45,139 135,418 67,709 203,128 101,564 50,782 25,391 76,174 38,087 114,262

← Previous Integer #3,002,449 Browse Full Index Next Integer #3,002,451 →