2,093,361

3 × 697787

2,093,361 factors as 3 × 697787. Its 4 positive divisors give a proper-divisor sum of 697,791, so this integer is deficient. The Collatz stopping time is 135 steps.

Prime Factor Structure

Factorization String 3 × 697787

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 2,791,152

Proper Divisor Sum 697,791

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #2093359 ← → #2093389

Radix Representation

Decimal	2093361
Binary	111111111000100110001 (21 bits)
Octal	0o7770461
Hexadecimal	0x1FF131

Divisor Catalog (4)

1 3 697,787 2,093,361

Collatz Trajectory (135 steps to reach 1)

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

2,093,361 6,280,084 3,140,042 1,570,021 4,710,064 2,355,032 1,177,516 588,758 294,379 883,138 441,569 1,324,708 662,354 331,177 993,532 496,766 248,383 745,150 372,575 1,117,726 558,863 1,676,590 838,295 2,514,886 1,257,443 3,772,330 1,886,165 5,658,496 2,829,248 1,414,624 707,312 353,656 176,828 88,414 44,207 132,622 66,311 198,934 99,467 298,402 149,201 447,604 223,802 111,901 335,704 167,852 83,926 41,963 125,890 62,945 188,836 94,418 47,209 141,628 70,814 35,407 106,222 53,111 159,334 79,667

← Previous Integer #2,093,360 Browse Full Index Next Integer #2,093,362 →