2,168,154

2 × 3³ × 40151

2,168,154 factors as 2 × 3^3 × 40151. Its 16 positive divisors give a proper-divisor sum of 2,650,086, so this integer is abundant. The Collatz stopping time is 210 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 40151

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 4,818,240

Proper Divisor Sum 2,650,086

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #2168149 ← → #2168183

Radix Representation

Decimal	2168154
Binary	1000010001010101011010 (22 bits)
Octal	0o10212532
Hexadecimal	0x21155A

Divisor Catalog (16)

1 2 3 6 9 18 27 54 40,151 80,302 120,453 240,906 361,359 722,718 1,084,077 2,168,154

Collatz Trajectory (210 steps to reach 1)

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

2,168,154 1,084,077 3,252,232 1,626,116 813,058 406,529 1,219,588 609,794 304,897 914,692 457,346 228,673 686,020 343,010 171,505 514,516 257,258 128,629 385,888 192,944 96,472 48,236 24,118 12,059 36,178 18,089 54,268 27,134 13,567 40,702 20,351 61,054 30,527 91,582 45,791 137,374 68,687 206,062 103,031 309,094 154,547 463,642 231,821 695,464 347,732 173,866 86,933 260,800 130,400 65,200 32,600 16,300 8,150 4,075 12,226 6,113 18,340 9,170 4,585 13,756

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,168,153 Browse Full Index Next Integer #2,168,155 →