3,862,986

2 × 3 × 83 × 7757

3,862,986 factors as 2 × 3 × 83 × 7757. Its 16 positive divisors give a proper-divisor sum of 3,957,078, so this integer is abundant. The Collatz stopping time is 97 steps.

Prime Factor Structure

Factorization String 2 × 3 × 83 × 7757

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 7,820,064

Proper Divisor Sum 3,957,078

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #3862939 ← → #3862987

Radix Representation

Decimal	3862986
Binary	1110101111000111001010 (22 bits)
Octal	0o16570712
Hexadecimal	0x3AF1CA

Divisor Catalog (16)

1 2 3 6 83 166 249 498 7,757 15,514 23,271 46,542 643,831 1,287,662 1,931,493 3,862,986

Collatz Trajectory (97 steps to reach 1)

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

3,862,986 1,931,493 5,794,480 2,897,240 1,448,620 724,310 362,155 1,086,466 543,233 1,629,700 814,850 407,425 1,222,276 611,138 305,569 916,708 458,354 229,177 687,532 343,766 171,883 515,650 257,825 773,476 386,738 193,369 580,108 290,054 145,027 435,082 217,541 652,624 326,312 163,156 81,578 40,789 122,368 61,184 30,592 15,296 7,648 3,824 1,912 956 478 239 718 359 1,078 539 1,618 809 2,428 1,214 607 1,822 911 2,734 1,367 4,102

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,862,985 Browse Full Index Next Integer #3,862,987 →