3,916,086

2 × 3 × 17 × 38393

3,916,086 factors as 2 × 3 × 17 × 38393. Its 16 positive divisors give a proper-divisor sum of 4,377,018, so this integer is abundant. The Collatz stopping time is 198 steps.

Prime Factor Structure

Factorization String 2 × 3 × 17 × 38393

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 8,293,104

Proper Divisor Sum 4,377,018

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #3916079 ← → #3916091

Radix Representation

Decimal	3916086
Binary	1110111100000100110110 (22 bits)
Octal	0o16740466
Hexadecimal	0x3BC136

Divisor Catalog (16)

1 2 3 6 17 34 51 102 38,393 76,786 115,179 230,358 652,681 1,305,362 1,958,043 3,916,086

Collatz Trajectory (198 steps to reach 1)

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

3,916,086 1,958,043 5,874,130 2,937,065 8,811,196 4,405,598 2,202,799 6,608,398 3,304,199 9,912,598 4,956,299 14,868,898 7,434,449 22,303,348 11,151,674 5,575,837 16,727,512 8,363,756 4,181,878 2,090,939 6,272,818 3,136,409 9,409,228 4,704,614 2,352,307 7,056,922 3,528,461 10,585,384 5,292,692 2,646,346 1,323,173 3,969,520 1,984,760 992,380 496,190 248,095 744,286 372,143 1,116,430 558,215 1,674,646 837,323 2,511,970 1,255,985 3,767,956 1,883,978 941,989 2,825,968 1,412,984 706,492 353,246 176,623 529,870 264,935 794,806 397,403 1,192,210 596,105 1,788,316 894,158

← Previous Integer #3,916,085 Browse Full Index Next Integer #3,916,087 →