939,732

2² × 3 × 78311

939,732 factors as 2^2 × 3 × 78311. Its 12 positive divisors give a proper-divisor sum of 1,253,004, so this integer is abundant. The Collatz stopping time is 77 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 78311

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 2,192,736

Proper Divisor Sum 1,253,004

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #939713 ← → #939737

Radix Representation

Decimal	939732
Binary	11100101011011010100 (20 bits)
Octal	0o3453324
Hexadecimal	0xE56D4

Divisor Catalog (12)

1 2 3 4 6 12 78,311 156,622 234,933 313,244 469,866 939,732

Collatz Trajectory (77 steps to reach 1)

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

939,732 469,866 234,933 704,800 352,400 176,200 88,100 44,050 22,025 66,076 33,038 16,519 49,558 24,779 74,338 37,169 111,508 55,754 27,877 83,632 41,816 20,908 10,454 5,227 15,682 7,841 23,524 11,762 5,881 17,644 8,822 4,411 13,234 6,617 19,852 9,926 4,963 14,890 7,445 22,336 11,168 5,584 2,792 1,396 698 349 1,048 524 262 131 394 197 592 296 148 74 37 112 56 28

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #939,731 Browse Full Index Next Integer #939,733 →