4,500,906

2 × 3 × 750151

4,500,906 factors as 2 × 3 × 750151. Its 8 positive divisors give a proper-divisor sum of 4,500,918, so this integer is abundant. The Collatz stopping time is 136 steps.

Prime Factor Structure

Factorization String 2 × 3 × 750151

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 9,001,824

Proper Divisor Sum 4,500,918

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #4500901 ← → #4500907

Radix Representation

Decimal	4500906
Binary	10001001010110110101010 (23 bits)
Octal	0o21126652
Hexadecimal	0x44ADAA

Divisor Catalog (8)

1 2 3 6 750,151 1,500,302 2,250,453 4,500,906

Collatz Trajectory (136 steps to reach 1)

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

4,500,906 2,250,453 6,751,360 3,375,680 1,687,840 843,920 421,960 210,980 105,490 52,745 158,236 79,118 39,559 118,678 59,339 178,018 89,009 267,028 133,514 66,757 200,272 100,136 50,068 25,034 12,517 37,552 18,776 9,388 4,694 2,347 7,042 3,521 10,564 5,282 2,641 7,924 3,962 1,981 5,944 2,972 1,486 743 2,230 1,115 3,346 1,673 5,020 2,510 1,255 3,766 1,883 5,650 2,825 8,476 4,238 2,119 6,358 3,179 9,538 4,769

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,500,905 Browse Full Index Next Integer #4,500,907 →