1,942,914

2 × 3 × 323819

1,942,914 factors as 2 × 3 × 323819. Its 8 positive divisors give a proper-divisor sum of 1,942,926, so this integer is abundant. The Collatz stopping time is 96 steps.

Prime Factor Structure

Factorization String 2 × 3 × 323819

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 3,885,840

Proper Divisor Sum 1,942,926

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #1942909 ← → #1942939

Radix Representation

Decimal	1942914
Binary	111011010010110000010 (21 bits)
Octal	0o7322602
Hexadecimal	0x1DA582

Divisor Catalog (8)

1 2 3 6 323,819 647,638 971,457 1,942,914

Collatz Trajectory (96 steps to reach 1)

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

1,942,914 971,457 2,914,372 1,457,186 728,593 2,185,780 1,092,890 546,445 1,639,336 819,668 409,834 204,917 614,752 307,376 153,688 76,844 38,422 19,211 57,634 28,817 86,452 43,226 21,613 64,840 32,420 16,210 8,105 24,316 12,158 6,079 18,238 9,119 27,358 13,679 41,038 20,519 61,558 30,779 92,338 46,169 138,508 69,254 34,627 103,882 51,941 155,824 77,912 38,956 19,478 9,739 29,218 14,609 43,828 21,914 10,957 32,872 16,436 8,218 4,109 12,328

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,942,913 Browse Full Index Next Integer #1,942,915 →