2,292,186

2 × 3 × 13 × 29387

2,292,186 factors as 2 × 3 × 13 × 29387. Its 16 positive divisors give a proper-divisor sum of 2,644,998, so this integer is abundant. The Collatz stopping time is 148 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13 × 29387

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 4,937,184

Proper Divisor Sum 2,644,998

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #2292181 ← → #2292193

Radix Representation

Decimal	2292186
Binary	1000101111100111011010 (22 bits)
Octal	0o10574732
Hexadecimal	0x22F9DA

Divisor Catalog (16)

1 2 3 6 13 26 39 78 29,387 58,774 88,161 176,322 382,031 764,062 1,146,093 2,292,186

Collatz Trajectory (148 steps to reach 1)

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

2,292,186 1,146,093 3,438,280 1,719,140 859,570 429,785 1,289,356 644,678 322,339 967,018 483,509 1,450,528 725,264 362,632 181,316 90,658 45,329 135,988 67,994 33,997 101,992 50,996 25,498 12,749 38,248 19,124 9,562 4,781 14,344 7,172 3,586 1,793 5,380 2,690 1,345 4,036 2,018 1,009 3,028 1,514 757 2,272 1,136 568 284 142 71 214 107 322 161 484 242 121 364 182 91 274 137 412

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,292,185 Browse Full Index Next Integer #2,292,187 →