2,168,682

2 × 3 × 361447

2,168,682 factors as 2 × 3 × 361447. Its 8 positive divisors give a proper-divisor sum of 2,168,694, so this integer is abundant. The Collatz stopping time is 117 steps.

Prime Factor Structure

Factorization String 2 × 3 × 361447

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 4,337,376

Proper Divisor Sum 2,168,694

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #2168671 ← → #2168687

Radix Representation

Decimal	2168682
Binary	1000010001011101101010 (22 bits)
Octal	0o10213552
Hexadecimal	0x21176A

Divisor Catalog (8)

1 2 3 6 361,447 722,894 1,084,341 2,168,682

Collatz Trajectory (117 steps to reach 1)

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

2,168,682 1,084,341 3,253,024 1,626,512 813,256 406,628 203,314 101,657 304,972 152,486 76,243 228,730 114,365 343,096 171,548 85,774 42,887 128,662 64,331 192,994 96,497 289,492 144,746 72,373 217,120 108,560 54,280 27,140 13,570 6,785 20,356 10,178 5,089 15,268 7,634 3,817 11,452 5,726 2,863 8,590 4,295 12,886 6,443 19,330 9,665 28,996 14,498 7,249 21,748 10,874 5,437 16,312 8,156 4,078 2,039 6,118 3,059 9,178 4,589 13,768

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,168,681 Browse Full Index Next Integer #2,168,683 →