2,811,140

2² × 5 × 140557

2,811,140 factors as 2^2 × 5 × 140557. Its 12 positive divisors give a proper-divisor sum of 3,092,296, so this integer is abundant. The Collatz stopping time is 125 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 140557

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 5,903,436

Proper Divisor Sum 3,092,296

Digit Sum / Digital Root 17 (Root: 8)

Adjacent Primes #2811131 ← → #2811161

Radix Representation

Decimal	2811140
Binary	1010101110010100000100 (22 bits)
Octal	0o12562404
Hexadecimal	0x2AE504

Divisor Catalog (12)

1 2 4 5 10 20 140,557 281,114 562,228 702,785 1,405,570 2,811,140

Collatz Trajectory (125 steps to reach 1)

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

2,811,140 1,405,570 702,785 2,108,356 1,054,178 527,089 1,581,268 790,634 395,317 1,185,952 592,976 296,488 148,244 74,122 37,061 111,184 55,592 27,796 13,898 6,949 20,848 10,424 5,212 2,606 1,303 3,910 1,955 5,866 2,933 8,800 4,400 2,200 1,100 550 275 826 413 1,240 620 310 155 466 233 700 350 175 526 263 790 395 1,186 593 1,780 890 445 1,336 668 334 167 502

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,811,139 Browse Full Index Next Integer #2,811,141 →