2,250,516

2² × 3 × 29² × 223

2,250,516 factors as 2^2 × 3 × 29^2 × 223. Its 36 positive divisors give a proper-divisor sum of 3,212,396, so this integer is abundant. The Collatz stopping time is 135 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 29^2 × 223

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 5,462,912

Proper Divisor Sum 3,212,396

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #2250509 ← → #2250559

Radix Representation

Decimal	2250516
Binary	1000100101011100010100 (22 bits)
Octal	0o10453424
Hexadecimal	0x225714

Divisor Catalog (36)

1 2 3 4 6 12 29 58 87 116 174 223 348 446 669 841 892 1,338 1,682 2,523 2,676 3,364 5,046 6,467 10,092 12,934 19,401 25,868 38,802 77,604 187,543 375,086 562,629 750,172 1,125,258 2,250,516

Collatz Trajectory (135 steps to reach 1)

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

2,250,516 1,125,258 562,629 1,687,888 843,944 421,972 210,986 105,493 316,480 158,240 79,120 39,560 19,780 9,890 4,945 14,836 7,418 3,709 11,128 5,564 2,782 1,391 4,174 2,087 6,262 3,131 9,394 4,697 14,092 7,046 3,523 10,570 5,285 15,856 7,928 3,964 1,982 991 2,974 1,487 4,462 2,231 6,694 3,347 10,042 5,021 15,064 7,532 3,766 1,883 5,650 2,825 8,476 4,238 2,119 6,358 3,179 9,538 4,769 14,308

← Previous Integer #2,250,515 Browse Full Index Next Integer #2,250,517 →