2,000,669

11 × 239 × 761

2,000,669 factors as 11 × 239 × 761. Its 8 positive divisors give a proper-divisor sum of 193,891, so this integer is deficient. The Collatz stopping time is 91 steps.

Prime Factor Structure

Factorization String 11 × 239 × 761

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 2,194,560

Proper Divisor Sum 193,891

Digit Sum / Digital Root 23 (Root: 5)

Adjacent Primes #2000659 ← → #2000671

Radix Representation

Decimal	2000669
Binary	111101000011100011101 (21 bits)
Octal	0o7503435
Hexadecimal	0x1E871D

Divisor Catalog (8)

1 11 239 761 2,629 8,371 181,879 2,000,669

Collatz Trajectory (91 steps to reach 1)

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

2,000,669 6,002,008 3,001,004 1,500,502 750,251 2,250,754 1,125,377 3,376,132 1,688,066 844,033 2,532,100 1,266,050 633,025 1,899,076 949,538 474,769 1,424,308 712,154 356,077 1,068,232 534,116 267,058 133,529 400,588 200,294 100,147 300,442 150,221 450,664 225,332 112,666 56,333 169,000 84,500 42,250 21,125 63,376 31,688 15,844 7,922 3,961 11,884 5,942 2,971 8,914 4,457 13,372 6,686 3,343 10,030 5,015 15,046 7,523 22,570 11,285 33,856 16,928 8,464 4,232 2,116

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,000,668 Browse Full Index Next Integer #2,000,670 →