3,250,832

2⁴ × 13 × 15629

3,250,832 factors as 2^4 × 13 × 15629. Its 20 positive divisors give a proper-divisor sum of 3,532,588, so this integer is abundant. The Collatz stopping time is 146 steps.

Prime Factor Structure

Factorization String 2^4 × 13 × 15629

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 6,783,420

Proper Divisor Sum 3,532,588

Digit Sum / Digital Root 23 (Root: 5)

Adjacent Primes #3250831 ← → #3250837

Radix Representation

Decimal	3250832
Binary	1100011001101010010000 (22 bits)
Octal	0o14315220
Hexadecimal	0x319A90

Divisor Catalog (20)

Collatz Trajectory (146 steps to reach 1)

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

3,250,832 1,625,416 812,708 406,354 203,177 609,532 304,766 152,383 457,150 228,575 685,726 342,863 1,028,590 514,295 1,542,886 771,443 2,314,330 1,157,165 3,471,496 1,735,748 867,874 433,937 1,301,812 650,906 325,453 976,360 488,180 244,090 122,045 366,136 183,068 91,534 45,767 137,302 68,651 205,954 102,977 308,932 154,466 77,233 231,700 115,850 57,925 173,776 86,888 43,444 21,722 10,861 32,584 16,292 8,146 4,073 12,220 6,110 3,055 9,166 4,583 13,750 6,875 20,626

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,250,831 Browse Full Index Next Integer #3,250,833 →