2,546,480

2⁴ × 5 × 139 × 229

2,546,480 factors as 2^4 × 5 × 139 × 229. Its 40 positive divisors give a proper-divisor sum of 3,442,720, so this integer is abundant. The Collatz stopping time is 143 steps.

Prime Factor Structure

Factorization String 2^4 × 5 × 139 × 229

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 5,989,200

Proper Divisor Sum 3,442,720

Digit Sum / Digital Root 29 (Root: 2)

Adjacent Primes #2546443 ← → #2546497

Radix Representation

Decimal	2546480
Binary	1001101101101100110000 (22 bits)
Octal	0o11555460
Hexadecimal	0x26DB30

Divisor Catalog (40)

1 2 4 5 8 10 16 20 40 80 139 229 278 458 556 695 916 1,112 1,145 1,390 1,832 2,224 2,290 2,780 3,664 4,580 5,560 9,160 11,120 18,320 31,831 63,662 127,324 159,155 254,648 318,310 509,296 636,620 1,273,240 2,546,480

Collatz Trajectory (143 steps to reach 1)

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

2,546,480 1,273,240 636,620 318,310 159,155 477,466 238,733 716,200 358,100 179,050 89,525 268,576 134,288 67,144 33,572 16,786 8,393 25,180 12,590 6,295 18,886 9,443 28,330 14,165 42,496 21,248 10,624 5,312 2,656 1,328 664 332 166 83 250 125 376 188 94 47 142 71 214 107 322 161 484 242 121 364 182 91 274 137 412 206 103 310 155 466

← Previous Integer #2,546,479 Browse Full Index Next Integer #2,546,481 →