3,042,450

2 × 3² × 5² × 6761

3,042,450 factors as 2 × 3^2 × 5^2 × 6761. Its 36 positive divisors give a proper-divisor sum of 5,132,808, so this integer is abundant. The Collatz stopping time is 120 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 5^2 × 6761

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 8,175,258

Proper Divisor Sum 5,132,808

Digit Sum / Digital Root 18 (Root: 9)

Adjacent Primes #3042449 ← → #3042461

Radix Representation

Decimal	3042450
Binary	1011100110110010010010 (22 bits)
Octal	0o13466222
Hexadecimal	0x2E6C92

Divisor Catalog (36)

1 2 3 5 6 9 10 15 18 25 30 45 50 75 90 150 225 450 6,761 13,522 20,283 33,805 40,566 60,849 67,610 101,415 121,698 169,025 202,830 304,245 338,050 507,075 608,490 1,014,150 1,521,225 3,042,450

Collatz Trajectory (120 steps to reach 1)

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

3,042,450 1,521,225 4,563,676 2,281,838 1,140,919 3,422,758 1,711,379 5,134,138 2,567,069 7,701,208 3,850,604 1,925,302 962,651 2,887,954 1,443,977 4,331,932 2,165,966 1,082,983 3,248,950 1,624,475 4,873,426 2,436,713 7,310,140 3,655,070 1,827,535 5,482,606 2,741,303 8,223,910 4,111,955 12,335,866 6,167,933 18,503,800 9,251,900 4,625,950 2,312,975 6,938,926 3,469,463 10,408,390 5,204,195 15,612,586 7,806,293 23,418,880 11,709,440 5,854,720 2,927,360 1,463,680 731,840 365,920 182,960 91,480 45,740 22,870 11,435 34,306 17,153 51,460 25,730 12,865 38,596 19,298

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