4,068,040

2³ × 5 × 101701

4,068,040 factors as 2^3 × 5 × 101701. Its 16 positive divisors give a proper-divisor sum of 5,085,140, so this integer is abundant. The Collatz stopping time is 84 steps.

Prime Factor Structure

Factorization String 2^3 × 5 × 101701

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 9,153,180

Proper Divisor Sum 5,085,140

Digit Sum / Digital Root 22 (Root: 4)

Adjacent Primes #4068023 ← → #4068041

Radix Representation

Decimal	4068040
Binary	1111100001001011001000 (22 bits)
Octal	0o17411310
Hexadecimal	0x3E12C8

Divisor Catalog (16)

1 2 4 5 8 10 20 40 101,701 203,402 406,804 508,505 813,608 1,017,010 2,034,020 4,068,040

Collatz Trajectory (84 steps to reach 1)

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

4,068,040 2,034,020 1,017,010 508,505 1,525,516 762,758 381,379 1,144,138 572,069 1,716,208 858,104 429,052 214,526 107,263 321,790 160,895 482,686 241,343 724,030 362,015 1,086,046 543,023 1,629,070 814,535 2,443,606 1,221,803 3,665,410 1,832,705 5,498,116 2,749,058 1,374,529 4,123,588 2,061,794 1,030,897 3,092,692 1,546,346 773,173 2,319,520 1,159,760 579,880 289,940 144,970 72,485 217,456 108,728 54,364 27,182 13,591 40,774 20,387 61,162 30,581 91,744 45,872 22,936 11,468 5,734 2,867 8,602 4,301

← Previous Integer #4,068,039 Browse Full Index Next Integer #4,068,041 →