2,171,709

3² × 227 × 1063

2,171,709 factors as 3^2 × 227 × 1063. Its 12 positive divisors give a proper-divisor sum of 981,987, so this integer is deficient. The Collatz stopping time is 104 steps.

Prime Factor Structure

Factorization String 3^2 × 227 × 1063

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 3,153,696

Proper Divisor Sum 981,987

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #2171707 ← → #2171711

Radix Representation

Decimal	2171709
Binary	1000010010001100111101 (22 bits)
Octal	0o10221475
Hexadecimal	0x21233D

Divisor Catalog (12)

1 3 9 227 681 1,063 2,043 3,189 9,567 241,301 723,903 2,171,709

Collatz Trajectory (104 steps to reach 1)

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

2,171,709 6,515,128 3,257,564 1,628,782 814,391 2,443,174 1,221,587 3,664,762 1,832,381 5,497,144 2,748,572 1,374,286 687,143 2,061,430 1,030,715 3,092,146 1,546,073 4,638,220 2,319,110 1,159,555 3,478,666 1,739,333 5,218,000 2,609,000 1,304,500 652,250 326,125 978,376 489,188 244,594 122,297 366,892 183,446 91,723 275,170 137,585 412,756 206,378 103,189 309,568 154,784 77,392 38,696 19,348 9,674 4,837 14,512 7,256 3,628 1,814 907 2,722 1,361 4,084 2,042 1,021 3,064 1,532 766 383

← Previous Integer #2,171,708 Browse Full Index Next Integer #2,171,710 →