2,167,902

2 × 3² × 11 × 10949

2,167,902 factors as 2 × 3^2 × 11 × 10949. Its 24 positive divisors give a proper-divisor sum of 2,956,698, so this integer is abundant. The Collatz stopping time is 65 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 11 × 10949

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 5,124,600

Proper Divisor Sum 2,956,698

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #2167889 ← → #2167903

Radix Representation

Decimal	2167902
Binary	1000010001010001011110 (22 bits)
Octal	0o10212136
Hexadecimal	0x21145E

Divisor Catalog (24)

Collatz Trajectory (65 steps to reach 1)

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

2,167,902 1,083,951 3,251,854 1,625,927 4,877,782 2,438,891 7,316,674 3,658,337 10,975,012 5,487,506 2,743,753 8,231,260 4,115,630 2,057,815 6,173,446 3,086,723 9,260,170 4,630,085 13,890,256 6,945,128 3,472,564 1,736,282 868,141 2,604,424 1,302,212 651,106 325,553 976,660 488,330 244,165 732,496 366,248 183,124 91,562 45,781 137,344 68,672 34,336 17,168 8,584 4,292 2,146 1,073 3,220 1,610 805 2,416 1,208 604 302 151 454 227 682 341 1,024 512 256 128 64

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,167,901 Browse Full Index Next Integer #2,167,903 →