2,353,638

2 × 3 × 7 × 56039

2,353,638 factors as 2 × 3 × 7 × 56039. Its 16 positive divisors give a proper-divisor sum of 3,026,202, so this integer is abundant. The Collatz stopping time is 148 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 56039

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 5,379,840

Proper Divisor Sum 3,026,202

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #2353621 ← → #2353639

Radix Representation

Decimal	2353638
Binary	1000111110100111100110 (22 bits)
Octal	0o10764746
Hexadecimal	0x23E9E6

Divisor Catalog (16)

1 2 3 6 7 14 21 42 56,039 112,078 168,117 336,234 392,273 784,546 1,176,819 2,353,638

Collatz Trajectory (148 steps to reach 1)

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

2,353,638 1,176,819 3,530,458 1,765,229 5,295,688 2,647,844 1,323,922 661,961 1,985,884 992,942 496,471 1,489,414 744,707 2,234,122 1,117,061 3,351,184 1,675,592 837,796 418,898 209,449 628,348 314,174 157,087 471,262 235,631 706,894 353,447 1,060,342 530,171 1,590,514 795,257 2,385,772 1,192,886 596,443 1,789,330 894,665 2,683,996 1,341,998 670,999 2,012,998 1,006,499 3,019,498 1,509,749 4,529,248 2,264,624 1,132,312 566,156 283,078 141,539 424,618 212,309 636,928 318,464 159,232 79,616 39,808 19,904 9,952 4,976 2,488

← Previous Integer #2,353,637 Browse Full Index Next Integer #2,353,639 →