3,986,256

2⁴ × 3 × 83047

3,986,256 factors as 2^4 × 3 × 83047. Its 20 positive divisors give a proper-divisor sum of 6,311,696, so this integer is abundant. The Collatz stopping time is 229 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 83047

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 10,297,952

Proper Divisor Sum 6,311,696

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #3986243 ← → #3986263

Radix Representation

Decimal	3986256
Binary	1111001101001101010000 (22 bits)
Octal	0o17151520
Hexadecimal	0x3CD350

Divisor Catalog (20)

Collatz Trajectory (229 steps to reach 1)

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

3,986,256 1,993,128 996,564 498,282 249,141 747,424 373,712 186,856 93,428 46,714 23,357 70,072 35,036 17,518 8,759 26,278 13,139 39,418 19,709 59,128 29,564 14,782 7,391 22,174 11,087 33,262 16,631 49,894 24,947 74,842 37,421 112,264 56,132 28,066 14,033 42,100 21,050 10,525 31,576 15,788 7,894 3,947 11,842 5,921 17,764 8,882 4,441 13,324 6,662 3,331 9,994 4,997 14,992 7,496 3,748 1,874 937 2,812 1,406 703

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,986,255 Browse Full Index Next Integer #3,986,257 →