3,000,506

2 × 1013 × 1481

3,000,506 factors as 2 × 1013 × 1481. Its 8 positive divisors give a proper-divisor sum of 1,507,738, so this integer is deficient. The Collatz stopping time is 89 steps.

Prime Factor Structure

Factorization String 2 × 1013 × 1481

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 4,508,244

Proper Divisor Sum 1,507,738

Digit Sum / Digital Root 14 (Root: 5)

Adjacent Primes #3000479 ← → #3000523

Radix Representation

Decimal	3000506
Binary	1011011100100010111010 (22 bits)
Octal	0o13344272
Hexadecimal	0x2DC8BA

Divisor Catalog (8)

1 2 1,013 1,481 2,026 2,962 1,500,253 3,000,506

Collatz Trajectory (89 steps to reach 1)

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

3,000,506 1,500,253 4,500,760 2,250,380 1,125,190 562,595 1,687,786 843,893 2,531,680 1,265,840 632,920 316,460 158,230 79,115 237,346 118,673 356,020 178,010 89,005 267,016 133,508 66,754 33,377 100,132 50,066 25,033 75,100 37,550 18,775 56,326 28,163 84,490 42,245 126,736 63,368 31,684 15,842 7,921 23,764 11,882 5,941 17,824 8,912 4,456 2,228 1,114 557 1,672 836 418 209 628 314 157 472 236 118 59 178 89

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,000,505 Browse Full Index Next Integer #3,000,507 →