3,020,144

2⁴ × 31 × 6089

3,020,144 factors as 2^4 × 31 × 6089. Its 20 positive divisors give a proper-divisor sum of 3,021,136, so this integer is abundant. The Collatz stopping time is 89 steps.

Prime Factor Structure

Factorization String 2^4 × 31 × 6089

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 6,041,280

Proper Divisor Sum 3,021,136

Digit Sum / Digital Root 14 (Root: 5)

Adjacent Primes #3020123 ← → #3020161

Radix Representation

Decimal	3020144
Binary	1011100001010101110000 (22 bits)
Octal	0o13412560
Hexadecimal	0x2E1570

Divisor Catalog (20)

Collatz Trajectory (89 steps to reach 1)

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

3,020,144 1,510,072 755,036 377,518 188,759 566,278 283,139 849,418 424,709 1,274,128 637,064 318,532 159,266 79,633 238,900 119,450 59,725 179,176 89,588 44,794 22,397 67,192 33,596 16,798 8,399 25,198 12,599 37,798 18,899 56,698 28,349 85,048 42,524 21,262 10,631 31,894 15,947 47,842 23,921 71,764 35,882 17,941 53,824 26,912 13,456 6,728 3,364 1,682 841 2,524 1,262 631 1,894 947 2,842 1,421 4,264 2,132 1,066 533

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,020,143 Browse Full Index Next Integer #3,020,145 →