3,020,232

2³ × 3 × 61 × 2063

3,020,232 factors as 2^3 × 3 × 61 × 2063. Its 32 positive divisors give a proper-divisor sum of 4,657,848, so this integer is abundant. The Collatz stopping time is 94 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 61 × 2063

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 7,678,080

Proper Divisor Sum 4,657,848

Digit Sum / Digital Root 12 (Root: 3)

Adjacent Primes #3020231 ← → #3020233

Radix Representation

Decimal	3020232
Binary	1011100001010111001000 (22 bits)
Octal	0o13412710
Hexadecimal	0x2E15C8

Divisor Catalog (32)

Collatz Trajectory (94 steps to reach 1)

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

3,020,232 1,510,116 755,058 377,529 1,132,588 566,294 283,147 849,442 424,721 1,274,164 637,082 318,541 955,624 477,812 238,906 119,453 358,360 179,180 89,590 44,795 134,386 67,193 201,580 100,790 50,395 151,186 75,593 226,780 113,390 56,695 170,086 85,043 255,130 127,565 382,696 191,348 95,674 47,837 143,512 71,756 35,878 17,939 53,818 26,909 80,728 40,364 20,182 10,091 30,274 15,137 45,412 22,706 11,353 34,060 17,030 8,515 25,546 12,773 38,320 19,160

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,020,231 Browse Full Index Next Integer #3,020,233 →