2,864,802

2 × 3 × 367 × 1301

2,864,802 factors as 2 × 3 × 367 × 1301. Its 16 positive divisors give a proper-divisor sum of 2,884,830, so this integer is abundant. The Collatz stopping time is 76 steps.

Prime Factor Structure

Factorization String 2 × 3 × 367 × 1301

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 5,749,632

Proper Divisor Sum 2,884,830

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #2864761 ← → #2864831

Radix Representation

Decimal	2864802
Binary	1010111011011010100010 (22 bits)
Octal	0o12733242
Hexadecimal	0x2BB6A2

Divisor Catalog (16)

1 2 3 6 367 734 1,101 1,301 2,202 2,602 3,903 7,806 477,467 954,934 1,432,401 2,864,802

Collatz Trajectory (76 steps to reach 1)

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

2,864,802 1,432,401 4,297,204 2,148,602 1,074,301 3,222,904 1,611,452 805,726 402,863 1,208,590 604,295 1,812,886 906,443 2,719,330 1,359,665 4,078,996 2,039,498 1,019,749 3,059,248 1,529,624 764,812 382,406 191,203 573,610 286,805 860,416 430,208 215,104 107,552 53,776 26,888 13,444 6,722 3,361 10,084 5,042 2,521 7,564 3,782 1,891 5,674 2,837 8,512 4,256 2,128 1,064 532 266 133 400 200 100 50 25 76 38 19 58 29 88

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,864,801 Browse Full Index Next Integer #2,864,803 →