326,208

2⁶ × 3 × 1699

326,208 factors as 2^6 × 3 × 1699. Its 28 positive divisors give a proper-divisor sum of 537,392, so this integer is abundant. The Collatz stopping time is 184 steps.

Prime Factor Structure

Factorization String 2^6 × 3 × 1699

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 28

Divisor Sum (σ) 863,600

Proper Divisor Sum 537,392

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #326203 ← → #326219

Radix Representation

Decimal	326208
Binary	1001111101001000000 (19 bits)
Octal	0o1175100
Hexadecimal	0x4FA40

Divisor Catalog (28)

1 2 3 4 6 8 12 16 24 32 48 64 96 192 1,699 3,398 5,097 6,796 10,194 13,592 20,388 27,184 40,776 54,368 81,552 108,736 163,104 326,208

Collatz Trajectory (184 steps to reach 1)

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

326,208 163,104 81,552 40,776 20,388 10,194 5,097 15,292 7,646 3,823 11,470 5,735 17,206 8,603 25,810 12,905 38,716 19,358 9,679 29,038 14,519 43,558 21,779 65,338 32,669 98,008 49,004 24,502 12,251 36,754 18,377 55,132 27,566 13,783 41,350 20,675 62,026 31,013 93,040 46,520 23,260 11,630 5,815 17,446 8,723 26,170 13,085 39,256 19,628 9,814 4,907 14,722 7,361 22,084 11,042 5,521 16,564 8,282 4,141 12,424

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #326,207 Browse Full Index Next Integer #326,209 →