2,171,280

2⁴ × 3 × 5 × 83 × 109

2,171,280 factors as 2^4 × 3 × 5 × 83 × 109. Its 80 positive divisors give a proper-divisor sum of 4,703,280, so this integer is abundant. The Collatz stopping time is 91 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 5 × 83 × 109

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 80

Divisor Sum (σ) 6,874,560

Proper Divisor Sum 4,703,280

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #2171261 ← → #2171293

Radix Representation

Decimal	2171280
Binary	1000010010000110010000 (22 bits)
Octal	0o10220620
Hexadecimal	0x212190

Divisor Catalog (60 of 80)

1 2 3 4 5 6 8 10 12 15 16 20 24 30 40 48 60 80 83 109 120 166 218 240 249 327 332 415 436 498 545 654 664 830 872 996 1,090 1,245 1,308 1,328 1,635 1,660 1,744 1,992 2,180 2,490 2,616 3,270 3,320 3,984 4,360 4,980 5,232 6,540 6,640 8,720 9,047 9,960 13,080 18,094

Collatz Trajectory (91 steps to reach 1)

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

2,171,280 1,085,640 542,820 271,410 135,705 407,116 203,558 101,779 305,338 152,669 458,008 229,004 114,502 57,251 171,754 85,877 257,632 128,816 64,408 32,204 16,102 8,051 24,154 12,077 36,232 18,116 9,058 4,529 13,588 6,794 3,397 10,192 5,096 2,548 1,274 637 1,912 956 478 239 718 359 1,078 539 1,618 809 2,428 1,214 607 1,822 911 2,734 1,367 4,102 2,051 6,154 3,077 9,232 4,616 2,308

← Previous Integer #2,171,279 Browse Full Index Next Integer #2,171,281 →