3,239,778

2 × 3 × 89 × 6067

3,239,778 factors as 2 × 3 × 89 × 6067. Its 16 positive divisors give a proper-divisor sum of 3,313,662, so this integer is abundant. The Collatz stopping time is 63 steps.

Prime Factor Structure

Factorization String 2 × 3 × 89 × 6067

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 6,553,440

Proper Divisor Sum 3,313,662

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #3239773 ← → #3239783

Radix Representation

Decimal	3239778
Binary	1100010110111101100010 (22 bits)
Octal	0o14267542
Hexadecimal	0x316F62

Divisor Catalog (16)

1 2 3 6 89 178 267 534 6,067 12,134 18,201 36,402 539,963 1,079,926 1,619,889 3,239,778

Collatz Trajectory (63 steps to reach 1)

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

3,239,778 1,619,889 4,859,668 2,429,834 1,214,917 3,644,752 1,822,376 911,188 455,594 227,797 683,392 341,696 170,848 85,424 42,712 21,356 10,678 5,339 16,018 8,009 24,028 12,014 6,007 18,022 9,011 27,034 13,517 40,552 20,276 10,138 5,069 15,208 7,604 3,802 1,901 5,704 2,852 1,426 713 2,140 1,070 535 1,606 803 2,410 1,205 3,616 1,808 904 452 226 113 340 170 85 256 128 64 32 16

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,239,777 Browse Full Index Next Integer #3,239,779 →