4,032,816

2⁴ × 3 × 84017

4,032,816 factors as 2^4 × 3 × 84017. Its 20 positive divisors give a proper-divisor sum of 6,385,416, so this integer is abundant. The Collatz stopping time is 92 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 84017

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 10,418,232

Proper Divisor Sum 6,385,416

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #4032811 ← → #4032839

Radix Representation

Decimal	4032816
Binary	1111011000100100110000 (22 bits)
Octal	0o17304460
Hexadecimal	0x3D8930

Divisor Catalog (20)

Collatz Trajectory (92 steps to reach 1)

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

4,032,816 2,016,408 1,008,204 504,102 252,051 756,154 378,077 1,134,232 567,116 283,558 141,779 425,338 212,669 638,008 319,004 159,502 79,751 239,254 119,627 358,882 179,441 538,324 269,162 134,581 403,744 201,872 100,936 50,468 25,234 12,617 37,852 18,926 9,463 28,390 14,195 42,586 21,293 63,880 31,940 15,970 7,985 23,956 11,978 5,989 17,968 8,984 4,492 2,246 1,123 3,370 1,685 5,056 2,528 1,264 632 316 158 79 238 119

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,032,815 Browse Full Index Next Integer #4,032,817 →