2,669,964

2² × 3 × 11 × 113 × 179

2,669,964 factors as 2^2 × 3 × 11 × 113 × 179. Its 48 positive divisors give a proper-divisor sum of 4,224,756, so this integer is abundant. The Collatz stopping time is 112 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 11 × 113 × 179

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 6,894,720

Proper Divisor Sum 4,224,756

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #2669959 ← → #2669977

Radix Representation

Decimal	2669964
Binary	1010001011110110001100 (22 bits)
Octal	0o12136614
Hexadecimal	0x28BD8C

Divisor Catalog (48)

1 2 3 4 6 11 12 22 33 44 66 113 132 179 226 339 358 452 537 678 716 1,074 1,243 1,356 1,969 2,148 2,486 3,729 3,938 4,972 5,907 7,458 7,876 11,814 14,916 20,227 23,628 40,454 60,681 80,908 121,362 222,497 242,724 444,994 667,491 889,988 1,334,982 2,669,964

Collatz Trajectory (112 steps to reach 1)

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

2,669,964 1,334,982 667,491 2,002,474 1,001,237 3,003,712 1,501,856 750,928 375,464 187,732 93,866 46,933 140,800 70,400 35,200 17,600 8,800 4,400 2,200 1,100 550 275 826 413 1,240 620 310 155 466 233 700 350 175 526 263 790 395 1,186 593 1,780 890 445 1,336 668 334 167 502 251 754 377 1,132 566 283 850 425 1,276 638 319 958 479

← Previous Integer #2,669,963 Browse Full Index Next Integer #2,669,965 →