3,272,316

2² × 3 × 272693

3,272,316 factors as 2^2 × 3 × 272693. Its 12 positive divisors give a proper-divisor sum of 4,363,116, so this integer is abundant. The Collatz stopping time is 164 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 272693

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 7,635,432

Proper Divisor Sum 4,363,116

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #3272309 ← → #3272323

Radix Representation

Decimal	3272316
Binary	1100011110111001111100 (22 bits)
Octal	0o14367174
Hexadecimal	0x31EE7C

Divisor Catalog (12)

1 2 3 4 6 12 272,693 545,386 818,079 1,090,772 1,636,158 3,272,316

Collatz Trajectory (164 steps to reach 1)

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

3,272,316 1,636,158 818,079 2,454,238 1,227,119 3,681,358 1,840,679 5,522,038 2,761,019 8,283,058 4,141,529 12,424,588 6,212,294 3,106,147 9,318,442 4,659,221 13,977,664 6,988,832 3,494,416 1,747,208 873,604 436,802 218,401 655,204 327,602 163,801 491,404 245,702 122,851 368,554 184,277 552,832 276,416 138,208 69,104 34,552 17,276 8,638 4,319 12,958 6,479 19,438 9,719 29,158 14,579 43,738 21,869 65,608 32,804 16,402 8,201 24,604 12,302 6,151 18,454 9,227 27,682 13,841 41,524 20,762

← Previous Integer #3,272,315 Browse Full Index Next Integer #3,272,317 →