2,604,492

2² × 3² × 11 × 6577

2,604,492 factors as 2^2 × 3^2 × 11 × 6577. Its 36 positive divisors give a proper-divisor sum of 4,578,684, so this integer is abundant. The Collatz stopping time is 81 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 11 × 6577

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 7,183,176

Proper Divisor Sum 4,578,684

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #2604439 ← → #2604499

Radix Representation

Decimal	2604492
Binary	1001111011110111001100 (22 bits)
Octal	0o11736714
Hexadecimal	0x27BDCC

Divisor Catalog (36)

1 2 3 4 6 9 11 12 18 22 33 36 44 66 99 132 198 396 6,577 13,154 19,731 26,308 39,462 59,193 72,347 78,924 118,386 144,694 217,041 236,772 289,388 434,082 651,123 868,164 1,302,246 2,604,492

Collatz Trajectory (81 steps to reach 1)

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

2,604,492 1,302,246 651,123 1,953,370 976,685 2,930,056 1,465,028 732,514 366,257 1,098,772 549,386 274,693 824,080 412,040 206,020 103,010 51,505 154,516 77,258 38,629 115,888 57,944 28,972 14,486 7,243 21,730 10,865 32,596 16,298 8,149 24,448 12,224 6,112 3,056 1,528 764 382 191 574 287 862 431 1,294 647 1,942 971 2,914 1,457 4,372 2,186 1,093 3,280 1,640 820 410 205 616 308 154 77

← Previous Integer #2,604,491 Browse Full Index Next Integer #2,604,493 →