2,912,770

2 × 5 × 7 × 41611

2,912,770 factors as 2 × 5 × 7 × 41611. Its 16 positive divisors give a proper-divisor sum of 3,079,358, so this integer is abundant. The Collatz stopping time is 89 steps.

Prime Factor Structure

Factorization String 2 × 5 × 7 × 41611

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 5,992,128

Proper Divisor Sum 3,079,358

Digit Sum / Digital Root 28 (Root: 1)

Adjacent Primes #2912761 ← → #2912779

Radix Representation

Decimal	2912770
Binary	1011000111001000000010 (22 bits)
Octal	0o13071002
Hexadecimal	0x2C7202

Divisor Catalog (16)

1 2 5 7 10 14 35 70 41,611 83,222 208,055 291,277 416,110 582,554 1,456,385 2,912,770

Collatz Trajectory (89 steps to reach 1)

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

2,912,770 1,456,385 4,369,156 2,184,578 1,092,289 3,276,868 1,638,434 819,217 2,457,652 1,228,826 614,413 1,843,240 921,620 460,810 230,405 691,216 345,608 172,804 86,402 43,201 129,604 64,802 32,401 97,204 48,602 24,301 72,904 36,452 18,226 9,113 27,340 13,670 6,835 20,506 10,253 30,760 15,380 7,690 3,845 11,536 5,768 2,884 1,442 721 2,164 1,082 541 1,624 812 406 203 610 305 916 458 229 688 344 172 86

← Previous Integer #2,912,769 Browse Full Index Next Integer #2,912,771 →