2,594,196

2² × 3² × 11 × 6551

2,594,196 factors as 2^2 × 3^2 × 11 × 6551. Its 36 positive divisors give a proper-divisor sum of 4,560,588, so this integer is abundant. The Collatz stopping time is 68 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 11 × 6551

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 7,154,784

Proper Divisor Sum 4,560,588

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #2594167 ← → #2594209

Radix Representation

Decimal	2594196
Binary	1001111001010110010100 (22 bits)
Octal	0o11712624
Hexadecimal	0x279594

Divisor Catalog (36)

1 2 3 4 6 9 11 12 18 22 33 36 44 66 99 132 198 396 6,551 13,102 19,653 26,204 39,306 58,959 72,061 78,612 117,918 144,122 216,183 235,836 288,244 432,366 648,549 864,732 1,297,098 2,594,196

Collatz Trajectory (68 steps to reach 1)

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

2,594,196 1,297,098 648,549 1,945,648 972,824 486,412 243,206 121,603 364,810 182,405 547,216 273,608 136,804 68,402 34,201 102,604 51,302 25,651 76,954 38,477 115,432 57,716 28,858 14,429 43,288 21,644 10,822 5,411 16,234 8,117 24,352 12,176 6,088 3,044 1,522 761 2,284 1,142 571 1,714 857 2,572 1,286 643 1,930 965 2,896 1,448 724 362 181 544 272 136 68 34 17 52 26 13

← Previous Integer #2,594,195 Browse Full Index Next Integer #2,594,197 →