1,645,716

2² × 3 × 137143

1,645,716 factors as 2^2 × 3 × 137143. Its 12 positive divisors give a proper-divisor sum of 2,194,316, so this integer is abundant. The Collatz stopping time is 176 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 137143

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 3,840,032

Proper Divisor Sum 2,194,316

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #1645691 ← → #1645727

Radix Representation

Decimal	1645716
Binary	110010001110010010100 (21 bits)
Octal	0o6216224
Hexadecimal	0x191C94

Divisor Catalog (12)

1 2 3 4 6 12 137,143 274,286 411,429 548,572 822,858 1,645,716

Collatz Trajectory (176 steps to reach 1)

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

1,645,716 822,858 411,429 1,234,288 617,144 308,572 154,286 77,143 231,430 115,715 347,146 173,573 520,720 260,360 130,180 65,090 32,545 97,636 48,818 24,409 73,228 36,614 18,307 54,922 27,461 82,384 41,192 20,596 10,298 5,149 15,448 7,724 3,862 1,931 5,794 2,897 8,692 4,346 2,173 6,520 3,260 1,630 815 2,446 1,223 3,670 1,835 5,506 2,753 8,260 4,130 2,065 6,196 3,098 1,549 4,648 2,324 1,162 581 1,744

← Previous Integer #1,645,715 Browse Full Index Next Integer #1,645,717 →