2,063,893

13 × 158761

2,063,893 factors as 13 × 158761. Its 4 positive divisors give a proper-divisor sum of 158,775, so this integer is deficient. The Collatz stopping time is 91 steps.

Prime Factor Structure

Factorization String 13 × 158761

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 2,222,668

Proper Divisor Sum 158,775

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #2063881 ← → #2063903

Radix Representation

Decimal	2063893
Binary	111110111111000010101 (21 bits)
Octal	0o7677025
Hexadecimal	0x1F7E15

Divisor Catalog (4)

1 13 158,761 2,063,893

Collatz Trajectory (91 steps to reach 1)

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

2,063,893 6,191,680 3,095,840 1,547,920 773,960 386,980 193,490 96,745 290,236 145,118 72,559 217,678 108,839 326,518 163,259 489,778 244,889 734,668 367,334 183,667 551,002 275,501 826,504 413,252 206,626 103,313 309,940 154,970 77,485 232,456 116,228 58,114 29,057 87,172 43,586 21,793 65,380 32,690 16,345 49,036 24,518 12,259 36,778 18,389 55,168 27,584 13,792 6,896 3,448 1,724 862 431 1,294 647 1,942 971 2,914 1,457 4,372 2,186

← Previous Integer #2,063,892 Browse Full Index Next Integer #2,063,894 →