2,662,272

2⁷ × 3² × 2311

2,662,272 factors as 2^7 × 3^2 × 2311. Its 48 positive divisors give a proper-divisor sum of 5,002,008, so this integer is abundant. The Collatz stopping time is 94 steps.

Prime Factor Structure

Factorization String 2^7 × 3^2 × 2311

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 7,664,280

Proper Divisor Sum 5,002,008

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #2662271 ← → #2662291

Radix Representation

Decimal	2662272
Binary	1010001001111110000000 (22 bits)
Octal	0o12117600
Hexadecimal	0x289F80

Divisor Catalog (48)

1 2 3 4 6 8 9 12 16 18 24 32 36 48 64 72 96 128 144 192 288 384 576 1,152 2,311 4,622 6,933 9,244 13,866 18,488 20,799 27,732 36,976 41,598 55,464 73,952 83,196 110,928 147,904 166,392 221,856 295,808 332,784 443,712 665,568 887,424 1,331,136 2,662,272

Collatz Trajectory (94 steps to reach 1)

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

2,662,272 1,331,136 665,568 332,784 166,392 83,196 41,598 20,799 62,398 31,199 93,598 46,799 140,398 70,199 210,598 105,299 315,898 157,949 473,848 236,924 118,462 59,231 177,694 88,847 266,542 133,271 399,814 199,907 599,722 299,861 899,584 449,792 224,896 112,448 56,224 28,112 14,056 7,028 3,514 1,757 5,272 2,636 1,318 659 1,978 989 2,968 1,484 742 371 1,114 557 1,672 836 418 209 628 314 157 472

← Previous Integer #2,662,271 Browse Full Index Next Integer #2,662,273 →