2,739,560

2³ × 5 × 68489

2,739,560 factors as 2^3 × 5 × 68489. Its 16 positive divisors give a proper-divisor sum of 3,424,540, so this integer is abundant. The Collatz stopping time is 200 steps.

Prime Factor Structure

Factorization String 2^3 × 5 × 68489

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 6,164,100

Proper Divisor Sum 3,424,540

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #2739559 ← → #2739577

Radix Representation

Decimal	2739560
Binary	1010011100110101101000 (22 bits)
Octal	0o12346550
Hexadecimal	0x29CD68

Divisor Catalog (16)

1 2 4 5 8 10 20 40 68,489 136,978 273,956 342,445 547,912 684,890 1,369,780 2,739,560

Collatz Trajectory (200 steps to reach 1)

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

2,739,560 1,369,780 684,890 342,445 1,027,336 513,668 256,834 128,417 385,252 192,626 96,313 288,940 144,470 72,235 216,706 108,353 325,060 162,530 81,265 243,796 121,898 60,949 182,848 91,424 45,712 22,856 11,428 5,714 2,857 8,572 4,286 2,143 6,430 3,215 9,646 4,823 14,470 7,235 21,706 10,853 32,560 16,280 8,140 4,070 2,035 6,106 3,053 9,160 4,580 2,290 1,145 3,436 1,718 859 2,578 1,289 3,868 1,934 967 2,902

← Previous Integer #2,739,559 Browse Full Index Next Integer #2,739,561 →