2,819,328

2⁸ × 3 × 3671

2,819,328 factors as 2^8 × 3 × 3671. Its 36 positive divisors give a proper-divisor sum of 4,686,240, so this integer is abundant. The Collatz stopping time is 138 steps.

Prime Factor Structure

Factorization String 2^8 × 3 × 3671

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 7,505,568

Proper Divisor Sum 4,686,240

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #2819309 ← → #2819329

Radix Representation

Decimal	2819328
Binary	1010110000010100000000 (22 bits)
Octal	0o12602400
Hexadecimal	0x2B0500

Divisor Catalog (36)

1 2 3 4 6 8 12 16 24 32 48 64 96 128 192 256 384 768 3,671 7,342 11,013 14,684 22,026 29,368 44,052 58,736 88,104 117,472 176,208 234,944 352,416 469,888 704,832 939,776 1,409,664 2,819,328

Collatz Trajectory (138 steps to reach 1)

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

2,819,328 1,409,664 704,832 352,416 176,208 88,104 44,052 22,026 11,013 33,040 16,520 8,260 4,130 2,065 6,196 3,098 1,549 4,648 2,324 1,162 581 1,744 872 436 218 109 328 164 82 41 124 62 31 94 47 142 71 214 107 322 161 484 242 121 364 182 91 274 137 412 206 103 310 155 466 233 700 350 175 526

← Previous Integer #2,819,327 Browse Full Index Next Integer #2,819,329 →