4,662,096

2⁴ × 3 × 97127

4,662,096 factors as 2^4 × 3 × 97127. Its 20 positive divisors give a proper-divisor sum of 7,381,776, so this integer is abundant. The Collatz stopping time is 162 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 97127

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 12,043,872

Proper Divisor Sum 7,381,776

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #4662083 ← → #4662101

Radix Representation

Decimal	4662096
Binary	10001110010001101010000 (23 bits)
Octal	0o21621520
Hexadecimal	0x472350

Divisor Catalog (20)

1 2 3 4 6 8 12 16 24 48 97,127 194,254 291,381 388,508 582,762 777,016 1,165,524 1,554,032 2,331,048 4,662,096

Collatz Trajectory (162 steps to reach 1)

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

4,662,096 2,331,048 1,165,524 582,762 291,381 874,144 437,072 218,536 109,268 54,634 27,317 81,952 40,976 20,488 10,244 5,122 2,561 7,684 3,842 1,921 5,764 2,882 1,441 4,324 2,162 1,081 3,244 1,622 811 2,434 1,217 3,652 1,826 913 2,740 1,370 685 2,056 1,028 514 257 772 386 193 580 290 145 436 218 109 328 164 82 41 124 62 31 94 47 142

← Previous Integer #4,662,095 Browse Full Index Next Integer #4,662,097 →