3,316,660

2² × 5 × 165833

3,316,660 factors as 2^2 × 5 × 165833. Its 12 positive divisors give a proper-divisor sum of 3,648,368, so this integer is abundant. The Collatz stopping time is 115 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 165833

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 6,965,028

Proper Divisor Sum 3,648,368

Digit Sum / Digital Root 25 (Root: 7)

Adjacent Primes #3316639 ← → #3316661

Radix Representation

Decimal	3316660
Binary	1100101001101110110100 (22 bits)
Octal	0o14515664
Hexadecimal	0x329BB4

Divisor Catalog (12)

1 2 4 5 10 20 165,833 331,666 663,332 829,165 1,658,330 3,316,660

Collatz Trajectory (115 steps to reach 1)

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

3,316,660 1,658,330 829,165 2,487,496 1,243,748 621,874 310,937 932,812 466,406 233,203 699,610 349,805 1,049,416 524,708 262,354 131,177 393,532 196,766 98,383 295,150 147,575 442,726 221,363 664,090 332,045 996,136 498,068 249,034 124,517 373,552 186,776 93,388 46,694 23,347 70,042 35,021 105,064 52,532 26,266 13,133 39,400 19,700 9,850 4,925 14,776 7,388 3,694 1,847 5,542 2,771 8,314 4,157 12,472 6,236 3,118 1,559 4,678 2,339 7,018 3,509

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,316,659 Browse Full Index Next Integer #3,316,661 →