2,159,668

2² × 7 × 137 × 563

2,159,668 factors as 2^2 × 7 × 137 × 563. Its 24 positive divisors give a proper-divisor sum of 2,198,924, so this integer is abundant. The Collatz stopping time is 166 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 137 × 563

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 4,358,592

Proper Divisor Sum 2,198,924

Digit Sum / Digital Root 37 (Root: 1)

Adjacent Primes #2159639 ← → #2159669

Radix Representation

Decimal	2159668
Binary	1000001111010000110100 (22 bits)
Octal	0o10172064
Hexadecimal	0x20F434

Divisor Catalog (24)

Collatz Trajectory (166 steps to reach 1)

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

2,159,668 1,079,834 539,917 1,619,752 809,876 404,938 202,469 607,408 303,704 151,852 75,926 37,963 113,890 56,945 170,836 85,418 42,709 128,128 64,064 32,032 16,016 8,008 4,004 2,002 1,001 3,004 1,502 751 2,254 1,127 3,382 1,691 5,074 2,537 7,612 3,806 1,903 5,710 2,855 8,566 4,283 12,850 6,425 19,276 9,638 4,819 14,458 7,229 21,688 10,844 5,422 2,711 8,134 4,067 12,202 6,101 18,304 9,152 4,576 2,288

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,159,667 Browse Full Index Next Integer #2,159,669 →