3,265,686

2 × 3² × 419 × 433

3,265,686 factors as 2 × 3^2 × 419 × 433. Its 24 positive divisors give a proper-divisor sum of 3,843,234, so this integer is abundant. The Collatz stopping time is 177 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 419 × 433

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 7,108,920

Proper Divisor Sum 3,843,234

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #3265681 ← → #3265693

Radix Representation

Decimal	3265686
Binary	1100011101010010010110 (22 bits)
Octal	0o14352226
Hexadecimal	0x31D496

Divisor Catalog (24)

Collatz Trajectory (177 steps to reach 1)

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

3,265,686 1,632,843 4,898,530 2,449,265 7,347,796 3,673,898 1,836,949 5,510,848 2,755,424 1,377,712 688,856 344,428 172,214 86,107 258,322 129,161 387,484 193,742 96,871 290,614 145,307 435,922 217,961 653,884 326,942 163,471 490,414 245,207 735,622 367,811 1,103,434 551,717 1,655,152 827,576 413,788 206,894 103,447 310,342 155,171 465,514 232,757 698,272 349,136 174,568 87,284 43,642 21,821 65,464 32,732 16,366 8,183 24,550 12,275 36,826 18,413 55,240 27,620 13,810 6,905 20,716

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,265,685 Browse Full Index Next Integer #3,265,687 →