1,943,958

2 × 3 × 281 × 1153

1,943,958 factors as 2 × 3 × 281 × 1153. Its 16 positive divisors give a proper-divisor sum of 1,961,178, so this integer is abundant. The Collatz stopping time is 78 steps.

Prime Factor Structure

Factorization String 2 × 3 × 281 × 1153

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 3,905,136

Proper Divisor Sum 1,961,178

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #1943951 ← → #1943959

Radix Representation

Decimal	1943958
Binary	111011010100110010110 (21 bits)
Octal	0o7324626
Hexadecimal	0x1DA996

Divisor Catalog (16)

1 2 3 6 281 562 843 1,153 1,686 2,306 3,459 6,918 323,993 647,986 971,979 1,943,958

Collatz Trajectory (78 steps to reach 1)

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

1,943,958 971,979 2,915,938 1,457,969 4,373,908 2,186,954 1,093,477 3,280,432 1,640,216 820,108 410,054 205,027 615,082 307,541 922,624 461,312 230,656 115,328 57,664 28,832 14,416 7,208 3,604 1,802 901 2,704 1,352 676 338 169 508 254 127 382 191 574 287 862 431 1,294 647 1,942 971 2,914 1,457 4,372 2,186 1,093 3,280 1,640 820 410 205 616 308 154 77 232 116 58

More profiles

Browse other published profiles and their separate link collections.

Profile #8,342,168 Profile #1,146,956 Profile #9,712,347 Profile #6,573,969 Profile #965,653 Profile #4,620,983 Profile #853,259 Profile #1,288,150

← Previous Integer #1,943,957 Browse Full Index Next Integer #1,943,959 →