3,000,916

2² × 750229

3,000,916 factors as 2^2 × 750229. Its 6 positive divisors give a proper-divisor sum of 2,250,694, so this integer is deficient. The Collatz stopping time is 138 steps.

Prime Factor Structure

Factorization String 2^2 × 750229

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 6

Divisor Sum (σ) 5,251,610

Proper Divisor Sum 2,250,694

Digit Sum / Digital Root 19 (Root: 1)

Adjacent Primes #3000887 ← → #3000919

Radix Representation

Decimal	3000916
Binary	1011011100101001010100 (22 bits)
Octal	0o13345124
Hexadecimal	0x2DCA54

Divisor Catalog (6)

1 2 4 750,229 1,500,458 3,000,916

Collatz Trajectory (138 steps to reach 1)

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

3,000,916 1,500,458 750,229 2,250,688 1,125,344 562,672 281,336 140,668 70,334 35,167 105,502 52,751 158,254 79,127 237,382 118,691 356,074 178,037 534,112 267,056 133,528 66,764 33,382 16,691 50,074 25,037 75,112 37,556 18,778 9,389 28,168 14,084 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

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,000,915 Browse Full Index Next Integer #3,000,917 →