3,328,860

2² × 3 × 5 × 109 × 509

3,328,860 factors as 2^2 × 3 × 5 × 109 × 509. Its 48 positive divisors give a proper-divisor sum of 6,095,940, so this integer is abundant. The Collatz stopping time is 283 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 5 × 109 × 509

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 9,424,800

Proper Divisor Sum 6,095,940

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3328849 ← → #3328879

Radix Representation

Decimal	3328860
Binary	1100101100101101011100 (22 bits)
Octal	0o14545534
Hexadecimal	0x32CB5C

Divisor Catalog (48)

1 2 3 4 5 6 10 12 15 20 30 60 109 218 327 436 509 545 654 1,018 1,090 1,308 1,527 1,635 2,036 2,180 2,545 3,054 3,270 5,090 6,108 6,540 7,635 10,180 15,270 30,540 55,481 110,962 166,443 221,924 277,405 332,886 554,810 665,772 832,215 1,109,620 1,664,430 3,328,860

Collatz Trajectory (283 steps to reach 1)

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

3,328,860 1,664,430 832,215 2,496,646 1,248,323 3,744,970 1,872,485 5,617,456 2,808,728 1,404,364 702,182 351,091 1,053,274 526,637 1,579,912 789,956 394,978 197,489 592,468 296,234 148,117 444,352 222,176 111,088 55,544 27,772 13,886 6,943 20,830 10,415 31,246 15,623 46,870 23,435 70,306 35,153 105,460 52,730 26,365 79,096 39,548 19,774 9,887 29,662 14,831 44,494 22,247 66,742 33,371 100,114 50,057 150,172 75,086 37,543 112,630 56,315 168,946 84,473 253,420 126,710

← Previous Integer #3,328,859 Browse Full Index Next Integer #3,328,861 →