4,138,914

2 × 3 × 13 × 47 × 1129

4,138,914 factors as 2 × 3 × 13 × 47 × 1129. Its 32 positive divisors give a proper-divisor sum of 4,973,406, so this integer is abundant. The Collatz stopping time is 79 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13 × 47 × 1129

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 9,112,320

Proper Divisor Sum 4,973,406

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #4138877 ← → #4138933

Radix Representation

Decimal	4138914
Binary	1111110010011110100010 (22 bits)
Octal	0o17623642
Hexadecimal	0x3F27A2

Divisor Catalog (32)

Collatz Trajectory (79 steps to reach 1)

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

4,138,914 2,069,457 6,208,372 3,104,186 1,552,093 4,656,280 2,328,140 1,164,070 582,035 1,746,106 873,053 2,619,160 1,309,580 654,790 327,395 982,186 491,093 1,473,280 736,640 368,320 184,160 92,080 46,040 23,020 11,510 5,755 17,266 8,633 25,900 12,950 6,475 19,426 9,713 29,140 14,570 7,285 21,856 10,928 5,464 2,732 1,366 683 2,050 1,025 3,076 1,538 769 2,308 1,154 577 1,732 866 433 1,300 650 325 976 488 244 122

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,138,913 Browse Full Index Next Integer #4,138,915 →