4,653,582

2 × 3 × 41 × 18917

4,653,582 factors as 2 × 3 × 41 × 18917. Its 16 positive divisors give a proper-divisor sum of 4,881,090, so this integer is abundant. The Collatz stopping time is 162 steps.

Prime Factor Structure

Factorization String 2 × 3 × 41 × 18917

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 9,534,672

Proper Divisor Sum 4,881,090

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #4653577 ← → #4653587

Radix Representation

Decimal	4653582
Binary	10001110000001000001110 (23 bits)
Octal	0o21601016
Hexadecimal	0x47020E

Divisor Catalog (16)

1 2 3 6 41 82 123 246 18,917 37,834 56,751 113,502 775,597 1,551,194 2,326,791 4,653,582

Collatz Trajectory (162 steps to reach 1)

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

4,653,582 2,326,791 6,980,374 3,490,187 10,470,562 5,235,281 15,705,844 7,852,922 3,926,461 11,779,384 5,889,692 2,944,846 1,472,423 4,417,270 2,208,635 6,625,906 3,312,953 9,938,860 4,969,430 2,484,715 7,454,146 3,727,073 11,181,220 5,590,610 2,795,305 8,385,916 4,192,958 2,096,479 6,289,438 3,144,719 9,434,158 4,717,079 14,151,238 7,075,619 21,226,858 10,613,429 31,840,288 15,920,144 7,960,072 3,980,036 1,990,018 995,009 2,985,028 1,492,514 746,257 2,238,772 1,119,386 559,693 1,679,080 839,540 419,770 209,885 629,656 314,828 157,414 78,707 236,122 118,061 354,184 177,092

← Previous Integer #4,653,581 Browse Full Index Next Integer #4,653,583 →