1,782,234

2 × 3² × 99013

1,782,234 factors as 2 × 3^2 × 99013. Its 12 positive divisors give a proper-divisor sum of 2,079,312, so this integer is abundant. The Collatz stopping time is 158 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 99013

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 3,861,546

Proper Divisor Sum 2,079,312

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #1782211 ← → #1782239

Radix Representation

Decimal	1782234
Binary	110110011000111011010 (21 bits)
Octal	0o6630732
Hexadecimal	0x1B31DA

Divisor Catalog (12)

1 2 3 6 9 18 99,013 198,026 297,039 594,078 891,117 1,782,234

Collatz Trajectory (158 steps to reach 1)

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

1,782,234 891,117 2,673,352 1,336,676 668,338 334,169 1,002,508 501,254 250,627 751,882 375,941 1,127,824 563,912 281,956 140,978 70,489 211,468 105,734 52,867 158,602 79,301 237,904 118,952 59,476 29,738 14,869 44,608 22,304 11,152 5,576 2,788 1,394 697 2,092 1,046 523 1,570 785 2,356 1,178 589 1,768 884 442 221 664 332 166 83 250 125 376 188 94 47 142 71 214 107 322

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,782,233 Browse Full Index Next Integer #1,782,235 →