2,785,686

2 × 3 × 464281

2,785,686 factors as 2 × 3 × 464281. Its 8 positive divisors give a proper-divisor sum of 2,785,698, so this integer is abundant. The Collatz stopping time is 200 steps.

Prime Factor Structure

Factorization String 2 × 3 × 464281

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 5,571,384

Proper Divisor Sum 2,785,698

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #2785667 ← → #2785697

Radix Representation

Decimal	2785686
Binary	1010101000000110010110 (22 bits)
Octal	0o12500626
Hexadecimal	0x2A8196

Divisor Catalog (8)

1 2 3 6 464,281 928,562 1,392,843 2,785,686

Collatz Trajectory (200 steps to reach 1)

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

2,785,686 1,392,843 4,178,530 2,089,265 6,267,796 3,133,898 1,566,949 4,700,848 2,350,424 1,175,212 587,606 293,803 881,410 440,705 1,322,116 661,058 330,529 991,588 495,794 247,897 743,692 371,846 185,923 557,770 278,885 836,656 418,328 209,164 104,582 52,291 156,874 78,437 235,312 117,656 58,828 29,414 14,707 44,122 22,061 66,184 33,092 16,546 8,273 24,820 12,410 6,205 18,616 9,308 4,654 2,327 6,982 3,491 10,474 5,237 15,712 7,856 3,928 1,964 982 491

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,785,685 Browse Full Index Next Integer #2,785,687 →