2,556,600

2³ × 3 × 5² × 4261

2,556,600 factors as 2^3 × 3 × 5^2 × 4261. Its 48 positive divisors give a proper-divisor sum of 5,370,720, so this integer is abundant. The Collatz stopping time is 218 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 5^2 × 4261

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 7,927,320

Proper Divisor Sum 5,370,720

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #2556577 ← → #2556607

Radix Representation

Decimal	2556600
Binary	1001110000001010111000 (22 bits)
Octal	0o11601270
Hexadecimal	0x2702B8

Divisor Catalog (48)

1 2 3 4 5 6 8 10 12 15 20 24 25 30 40 50 60 75 100 120 150 200 300 600 4,261 8,522 12,783 17,044 21,305 25,566 34,088 42,610 51,132 63,915 85,220 102,264 106,525 127,830 170,440 213,050 255,660 319,575 426,100 511,320 639,150 852,200 1,278,300 2,556,600

Collatz Trajectory (218 steps to reach 1)

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

2,556,600 1,278,300 639,150 319,575 958,726 479,363 1,438,090 719,045 2,157,136 1,078,568 539,284 269,642 134,821 404,464 202,232 101,116 50,558 25,279 75,838 37,919 113,758 56,879 170,638 85,319 255,958 127,979 383,938 191,969 575,908 287,954 143,977 431,932 215,966 107,983 323,950 161,975 485,926 242,963 728,890 364,445 1,093,336 546,668 273,334 136,667 410,002 205,001 615,004 307,502 153,751 461,254 230,627 691,882 345,941 1,037,824 518,912 259,456 129,728 64,864 32,432 16,216

← Previous Integer #2,556,599 Browse Full Index Next Integer #2,556,601 →