3,000,615

3 × 5 × 200041

3,000,615 factors as 3 × 5 × 200041. Its 8 positive divisors give a proper-divisor sum of 1,800,393, so this integer is deficient. The Collatz stopping time is 89 steps.

Prime Factor Structure

Factorization String 3 × 5 × 200041

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 4,801,008

Proper Divisor Sum 1,800,393

Digit Sum / Digital Root 15 (Root: 6)

Adjacent Primes #3000611 ← → #3000617

Radix Representation

Decimal	3000615
Binary	1011011100100100100111 (22 bits)
Octal	0o13344447
Hexadecimal	0x2DC927

Divisor Catalog (8)

1 3 5 15 200,041 600,123 1,000,205 3,000,615

Collatz Trajectory (89 steps to reach 1)

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

3,000,615 9,001,846 4,500,923 13,502,770 6,751,385 20,254,156 10,127,078 5,063,539 15,190,618 7,595,309 22,785,928 11,392,964 5,696,482 2,848,241 8,544,724 4,272,362 2,136,181 6,408,544 3,204,272 1,602,136 801,068 400,534 200,267 600,802 300,401 901,204 450,602 225,301 675,904 337,952 168,976 84,488 42,244 21,122 10,561 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,614 Browse Full Index Next Integer #3,000,616 →