3,060,147

3 × 1020049

3,060,147 factors as 3 × 1020049. Its 4 positive divisors give a proper-divisor sum of 1,020,053, so this integer is deficient. The Collatz stopping time is 182 steps.

Prime Factor Structure

Factorization String 3 × 1020049

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 4,080,200

Proper Divisor Sum 1,020,053

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #3060143 ← → #3060149

Radix Representation

Decimal	3060147
Binary	1011101011000110110011 (22 bits)
Octal	0o13530663
Hexadecimal	0x2EB1B3

Divisor Catalog (4)

1 3 1,020,049 3,060,147

Collatz Trajectory (182 steps to reach 1)

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

3,060,147 9,180,442 4,590,221 13,770,664 6,885,332 3,442,666 1,721,333 5,164,000 2,582,000 1,291,000 645,500 322,750 161,375 484,126 242,063 726,190 363,095 1,089,286 544,643 1,633,930 816,965 2,450,896 1,225,448 612,724 306,362 153,181 459,544 229,772 114,886 57,443 172,330 86,165 258,496 129,248 64,624 32,312 16,156 8,078 4,039 12,118 6,059 18,178 9,089 27,268 13,634 6,817 20,452 10,226 5,113 15,340 7,670 3,835 11,506 5,753 17,260 8,630 4,315 12,946 6,473 19,420

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,060,146 Browse Full Index Next Integer #3,060,148 →