2,814,906

2 × 3 × 61 × 7691

2,814,906 factors as 2 × 3 × 61 × 7691. Its 16 positive divisors give a proper-divisor sum of 2,907,942, so this integer is abundant. The Collatz stopping time is 107 steps.

Prime Factor Structure

Factorization String 2 × 3 × 61 × 7691

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 5,722,848

Proper Divisor Sum 2,907,942

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #2814899 ← → #2814913

Radix Representation

Decimal	2814906
Binary	1010101111001110111010 (22 bits)
Octal	0o12571672
Hexadecimal	0x2AF3BA

Divisor Catalog (16)

1 2 3 6 61 122 183 366 7,691 15,382 23,073 46,146 469,151 938,302 1,407,453 2,814,906

Collatz Trajectory (107 steps to reach 1)

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

2,814,906 1,407,453 4,222,360 2,111,180 1,055,590 527,795 1,583,386 791,693 2,375,080 1,187,540 593,770 296,885 890,656 445,328 222,664 111,332 55,666 27,833 83,500 41,750 20,875 62,626 31,313 93,940 46,970 23,485 70,456 35,228 17,614 8,807 26,422 13,211 39,634 19,817 59,452 29,726 14,863 44,590 22,295 66,886 33,443 100,330 50,165 150,496 75,248 37,624 18,812 9,406 4,703 14,110 7,055 21,166 10,583 31,750 15,875 47,626 23,813 71,440 35,720 17,860

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,814,905 Browse Full Index Next Integer #2,814,907 →