2,652,138

2 × 3² × 147341

2,652,138 factors as 2 × 3^2 × 147341. Its 12 positive divisors give a proper-divisor sum of 3,094,200, so this integer is abundant. The Collatz stopping time is 125 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 147341

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 5,746,338

Proper Divisor Sum 3,094,200

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #2652131 ← → #2652149

Radix Representation

Decimal	2652138
Binary	1010000111011111101010 (22 bits)
Octal	0o12073752
Hexadecimal	0x2877EA

Divisor Catalog (12)

1 2 3 6 9 18 147,341 294,682 442,023 884,046 1,326,069 2,652,138

Collatz Trajectory (125 steps to reach 1)

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

2,652,138 1,326,069 3,978,208 1,989,104 994,552 497,276 248,638 124,319 372,958 186,479 559,438 279,719 839,158 419,579 1,258,738 629,369 1,888,108 944,054 472,027 1,416,082 708,041 2,124,124 1,062,062 531,031 1,593,094 796,547 2,389,642 1,194,821 3,584,464 1,792,232 896,116 448,058 224,029 672,088 336,044 168,022 84,011 252,034 126,017 378,052 189,026 94,513 283,540 141,770 70,885 212,656 106,328 53,164 26,582 13,291 39,874 19,937 59,812 29,906 14,953 44,860 22,430 11,215 33,646 16,823

← Previous Integer #2,652,137 Browse Full Index Next Integer #2,652,139 →