3,000,458

2 × 1500229

3,000,458 factors as 2 × 1500229. Its 4 positive divisors give a proper-divisor sum of 1,500,232, so this integer is deficient. The Collatz stopping time is 138 steps.

Prime Factor Structure

Factorization String 2 × 1500229

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 4,500,690

Proper Divisor Sum 1,500,232

Digit Sum / Digital Root 20 (Root: 2)

Adjacent Primes #3000409 ← → #3000463

Radix Representation

Decimal	3000458
Binary	1011011100100010001010 (22 bits)
Octal	0o13344212
Hexadecimal	0x2DC88A

Divisor Catalog (4)

1 2 1,500,229 3,000,458

Collatz Trajectory (138 steps to reach 1)

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

3,000,458 1,500,229 4,500,688 2,250,344 1,125,172 562,586 281,293 843,880 421,940 210,970 105,485 316,456 158,228 79,114 39,557 118,672 59,336 29,668 14,834 7,417 22,252 11,126 5,563 16,690 8,345 25,036 12,518 6,259 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,457 Browse Full Index Next Integer #3,000,459 →