2,070,676

2² × 31 × 16699

2,070,676 factors as 2^2 × 31 × 16699. Its 12 positive divisors give a proper-divisor sum of 1,670,124, so this integer is deficient. The Collatz stopping time is 135 steps.

Prime Factor Structure

Factorization String 2^2 × 31 × 16699

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 3,740,800

Proper Divisor Sum 1,670,124

Digit Sum / Digital Root 28 (Root: 1)

Adjacent Primes #2070661 ← → #2070709

Radix Representation

Decimal	2070676
Binary	111111001100010010100 (21 bits)
Octal	0o7714224
Hexadecimal	0x1F9894

Divisor Catalog (12)

1 2 4 31 62 124 16,699 33,398 66,796 517,669 1,035,338 2,070,676

Collatz Trajectory (135 steps to reach 1)

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

2,070,676 1,035,338 517,669 1,553,008 776,504 388,252 194,126 97,063 291,190 145,595 436,786 218,393 655,180 327,590 163,795 491,386 245,693 737,080 368,540 184,270 92,135 276,406 138,203 414,610 207,305 621,916 310,958 155,479 466,438 233,219 699,658 349,829 1,049,488 524,744 262,372 131,186 65,593 196,780 98,390 49,195 147,586 73,793 221,380 110,690 55,345 166,036 83,018 41,509 124,528 62,264 31,132 15,566 7,783 23,350 11,675 35,026 17,513 52,540 26,270 13,135

← Previous Integer #2,070,675 Browse Full Index Next Integer #2,070,677 →