2,564,310

2 × 3 × 5 × 7 × 12211

2,564,310 factors as 2 × 3 × 5 × 7 × 12211. Its 32 positive divisors give a proper-divisor sum of 4,469,802, so this integer is abundant. The Collatz stopping time is 99 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 7 × 12211

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 7,034,112

Proper Divisor Sum 4,469,802

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #2564279 ← → #2564321

Radix Representation

Decimal	2564310
Binary	1001110010000011010110 (22 bits)
Octal	0o11620326
Hexadecimal	0x2720D6

Divisor Catalog (32)

1 2 3 5 6 7 10 14 15 21 30 35 42 70 105 210 12,211 24,422 36,633 61,055 73,266 85,477 122,110 170,954 183,165 256,431 366,330 427,385 512,862 854,770 1,282,155 2,564,310

Collatz Trajectory (99 steps to reach 1)

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

2,564,310 1,282,155 3,846,466 1,923,233 5,769,700 2,884,850 1,442,425 4,327,276 2,163,638 1,081,819 3,245,458 1,622,729 4,868,188 2,434,094 1,217,047 3,651,142 1,825,571 5,476,714 2,738,357 8,215,072 4,107,536 2,053,768 1,026,884 513,442 256,721 770,164 385,082 192,541 577,624 288,812 144,406 72,203 216,610 108,305 324,916 162,458 81,229 243,688 121,844 60,922 30,461 91,384 45,692 22,846 11,423 34,270 17,135 51,406 25,703 77,110 38,555 115,666 57,833 173,500 86,750 43,375 130,126 65,063 195,190 97,595

← Previous Integer #2,564,309 Browse Full Index Next Integer #2,564,311 →