4,127,946

2 × 3 × 251 × 2741

4,127,946 factors as 2 × 3 × 251 × 2741. Its 16 positive divisors give a proper-divisor sum of 4,163,862, so this integer is abundant. The Collatz stopping time is 105 steps.

Prime Factor Structure

Factorization String 2 × 3 × 251 × 2741

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 8,291,808

Proper Divisor Sum 4,163,862

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #4127933 ← → #4127951

Radix Representation

Decimal	4127946
Binary	1111101111110011001010 (22 bits)
Octal	0o17576312
Hexadecimal	0x3EFCCA

Divisor Catalog (16)

1 2 3 6 251 502 753 1,506 2,741 5,482 8,223 16,446 687,991 1,375,982 2,063,973 4,127,946

Collatz Trajectory (105 steps to reach 1)

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

4,127,946 2,063,973 6,191,920 3,095,960 1,547,980 773,990 386,995 1,160,986 580,493 1,741,480 870,740 435,370 217,685 653,056 326,528 163,264 81,632 40,816 20,408 10,204 5,102 2,551 7,654 3,827 11,482 5,741 17,224 8,612 4,306 2,153 6,460 3,230 1,615 4,846 2,423 7,270 3,635 10,906 5,453 16,360 8,180 4,090 2,045 6,136 3,068 1,534 767 2,302 1,151 3,454 1,727 5,182 2,591 7,774 3,887 11,662 5,831 17,494 8,747 26,242

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,127,945 Browse Full Index Next Integer #4,127,947 →