2,756,250

2 × 3² × 5⁵ × 7²

2,756,250 factors as 2 × 3^2 × 5^5 × 7^2. Its 108 positive divisors give a proper-divisor sum of 5,926,788, so this integer is abundant. The Collatz stopping time is 200 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 5^5 × 7^2

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 108

Divisor Sum (σ) 8,683,038

Proper Divisor Sum 5,926,788

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #2756249 ← → #2756267

Radix Representation

Decimal	2756250
Binary	1010100000111010011010 (22 bits)
Octal	0o12407232
Hexadecimal	0x2A0E9A

Divisor Catalog (60 of 108)

1 2 3 5 6 7 9 10 14 15 18 21 25 30 35 42 45 49 50 63 70 75 90 98 105 125 126 147 150 175 210 225 245 250 294 315 350 375 441 450 490 525 625 630 735 750 875 882 1,050 1,125 1,225 1,250 1,470 1,575 1,750 1,875 2,205 2,250 2,450 2,625

Collatz Trajectory (200 steps to reach 1)

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

2,756,250 1,378,125 4,134,376 2,067,188 1,033,594 516,797 1,550,392 775,196 387,598 193,799 581,398 290,699 872,098 436,049 1,308,148 654,074 327,037 981,112 490,556 245,278 122,639 367,918 183,959 551,878 275,939 827,818 413,909 1,241,728 620,864 310,432 155,216 77,608 38,804 19,402 9,701 29,104 14,552 7,276 3,638 1,819 5,458 2,729 8,188 4,094 2,047 6,142 3,071 9,214 4,607 13,822 6,911 20,734 10,367 31,102 15,551 46,654 23,327 69,982 34,991 104,974

← Previous Integer #2,756,249 Browse Full Index Next Integer #2,756,251 →