3,260,004

2² × 3 × 11 × 24697

3,260,004 factors as 2^2 × 3 × 11 × 24697. Its 24 positive divisors give a proper-divisor sum of 5,038,524, so this integer is abundant. The Collatz stopping time is 115 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 11 × 24697

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 8,298,528

Proper Divisor Sum 5,038,524

Digit Sum / Digital Root 15 (Root: 6)

Adjacent Primes #3260003 ← → #3260017

Radix Representation

Decimal	3260004
Binary	1100011011111001100100 (22 bits)
Octal	0o14337144
Hexadecimal	0x31BE64

Divisor Catalog (24)

Collatz Trajectory (115 steps to reach 1)

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

3,260,004 1,630,002 815,001 2,445,004 1,222,502 611,251 1,833,754 916,877 2,750,632 1,375,316 687,658 343,829 1,031,488 515,744 257,872 128,936 64,468 32,234 16,117 48,352 24,176 12,088 6,044 3,022 1,511 4,534 2,267 6,802 3,401 10,204 5,102 2,551 7,654 3,827 11,482 5,741 17,224 8,612 4,306 2,153 6,460 3,230 1,615 4,846 2,423 7,270 3,635 10,906 5,453 16,360 8,180 4,090 2,045 6,136 3,068 1,534 767 2,302 1,151 3,454

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,260,003 Browse Full Index Next Integer #3,260,005 →