1,939,386

2 × 3 × 43 × 7517

1,939,386 factors as 2 × 3 × 43 × 7517. Its 16 positive divisors give a proper-divisor sum of 2,030,118, so this integer is abundant. The Collatz stopping time is 91 steps.

Prime Factor Structure

Factorization String 2 × 3 × 43 × 7517

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 3,969,504

Proper Divisor Sum 2,030,118

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #1939381 ← → #1939397

Radix Representation

Decimal	1939386
Binary	111011001011110111010 (21 bits)
Octal	0o7313672
Hexadecimal	0x1D97BA

Divisor Catalog (16)

1 2 3 6 43 86 129 258 7,517 15,034 22,551 45,102 323,231 646,462 969,693 1,939,386

Collatz Trajectory (91 steps to reach 1)

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

1,939,386 969,693 2,909,080 1,454,540 727,270 363,635 1,090,906 545,453 1,636,360 818,180 409,090 204,545 613,636 306,818 153,409 460,228 230,114 115,057 345,172 172,586 86,293 258,880 129,440 64,720 32,360 16,180 8,090 4,045 12,136 6,068 3,034 1,517 4,552 2,276 1,138 569 1,708 854 427 1,282 641 1,924 962 481 1,444 722 361 1,084 542 271 814 407 1,222 611 1,834 917 2,752 1,376 688 344

← Previous Integer #1,939,385 Browse Full Index Next Integer #1,939,387 →