1,789,932

2² × 3 × 149161

1,789,932 factors as 2^2 × 3 × 149161. Its 12 positive divisors give a proper-divisor sum of 2,386,604, so this integer is abundant. The Collatz stopping time is 114 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 149161

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 4,176,536

Proper Divisor Sum 2,386,604

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #1789927 ← → #1789951

Radix Representation

Decimal	1789932
Binary	110110100111111101100 (21 bits)
Octal	0o6647754
Hexadecimal	0x1B4FEC

Divisor Catalog (12)

1 2 3 4 6 12 149,161 298,322 447,483 596,644 894,966 1,789,932

Collatz Trajectory (114 steps to reach 1)

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

1,789,932 894,966 447,483 1,342,450 671,225 2,013,676 1,006,838 503,419 1,510,258 755,129 2,265,388 1,132,694 566,347 1,699,042 849,521 2,548,564 1,274,282 637,141 1,911,424 955,712 477,856 238,928 119,464 59,732 29,866 14,933 44,800 22,400 11,200 5,600 2,800 1,400 700 350 175 526 263 790 395 1,186 593 1,780 890 445 1,336 668 334 167 502 251 754 377 1,132 566 283 850 425 1,276 638 319

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,789,931 Browse Full Index Next Integer #1,789,933 →