4,062,516

2² × 3 × 338543

4,062,516 factors as 2^2 × 3 × 338543. Its 12 positive divisors give a proper-divisor sum of 5,416,716, so this integer is abundant. The Collatz stopping time is 84 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 338543

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 9,479,232

Proper Divisor Sum 5,416,716

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #4062493 ← → #4062521

Radix Representation

Decimal	4062516
Binary	1111011111110100110100 (22 bits)
Octal	0o17376464
Hexadecimal	0x3DFD34

Divisor Catalog (12)

1 2 3 4 6 12 338,543 677,086 1,015,629 1,354,172 2,031,258 4,062,516

Collatz Trajectory (84 steps to reach 1)

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

4,062,516 2,031,258 1,015,629 3,046,888 1,523,444 761,722 380,861 1,142,584 571,292 285,646 142,823 428,470 214,235 642,706 321,353 964,060 482,030 241,015 723,046 361,523 1,084,570 542,285 1,626,856 813,428 406,714 203,357 610,072 305,036 152,518 76,259 228,778 114,389 343,168 171,584 85,792 42,896 21,448 10,724 5,362 2,681 8,044 4,022 2,011 6,034 3,017 9,052 4,526 2,263 6,790 3,395 10,186 5,093 15,280 7,640 3,820 1,910 955 2,866 1,433 4,300

← Previous Integer #4,062,515 Browse Full Index Next Integer #4,062,517 →