3,225,872

2⁴ × 13² × 1193

3,225,872 factors as 2^4 × 13^2 × 1193. Its 30 positive divisors give a proper-divisor sum of 3,547,690, so this integer is abundant. The Collatz stopping time is 164 steps.

Prime Factor Structure

Factorization String 2^4 × 13^2 × 1193

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 30

Divisor Sum (σ) 6,773,562

Proper Divisor Sum 3,547,690

Digit Sum / Digital Root 29 (Root: 2)

Adjacent Primes #3225853 ← → #3225883

Radix Representation

Decimal	3225872
Binary	1100010011100100010000 (22 bits)
Octal	0o14234420
Hexadecimal	0x313910

Divisor Catalog (30)

Collatz Trajectory (164 steps to reach 1)

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

3,225,872 1,612,936 806,468 403,234 201,617 604,852 302,426 151,213 453,640 226,820 113,410 56,705 170,116 85,058 42,529 127,588 63,794 31,897 95,692 47,846 23,923 71,770 35,885 107,656 53,828 26,914 13,457 40,372 20,186 10,093 30,280 15,140 7,570 3,785 11,356 5,678 2,839 8,518 4,259 12,778 6,389 19,168 9,584 4,792 2,396 1,198 599 1,798 899 2,698 1,349 4,048 2,024 1,012 506 253 760 380 190 95

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,225,871 Browse Full Index Next Integer #3,225,873 →