2,820,104

2³ × 7 × 50359

2,820,104 factors as 2^3 × 7 × 50359. Its 16 positive divisors give a proper-divisor sum of 3,223,096, so this integer is abundant. The Collatz stopping time is 76 steps.

Prime Factor Structure

Factorization String 2^3 × 7 × 50359

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 6,043,200

Proper Divisor Sum 3,223,096

Digit Sum / Digital Root 17 (Root: 8)

Adjacent Primes #2820089 ← → #2820109

Radix Representation

Decimal	2820104
Binary	1010110000100000001000 (22 bits)
Octal	0o12604010
Hexadecimal	0x2B0808

Divisor Catalog (16)

1 2 4 7 8 14 28 56 50,359 100,718 201,436 352,513 402,872 705,026 1,410,052 2,820,104

Collatz Trajectory (76 steps to reach 1)

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

2,820,104 1,410,052 705,026 352,513 1,057,540 528,770 264,385 793,156 396,578 198,289 594,868 297,434 148,717 446,152 223,076 111,538 55,769 167,308 83,654 41,827 125,482 62,741 188,224 94,112 47,056 23,528 11,764 5,882 2,941 8,824 4,412 2,206 1,103 3,310 1,655 4,966 2,483 7,450 3,725 11,176 5,588 2,794 1,397 4,192 2,096 1,048 524 262 131 394 197 592 296 148 74 37 112 56 28 14

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,820,103 Browse Full Index Next Integer #2,820,105 →