1,909,578

2 × 3 × 11 × 28933

1,909,578 factors as 2 × 3 × 11 × 28933. Its 16 positive divisors give a proper-divisor sum of 2,256,918, so this integer is abundant. The Collatz stopping time is 78 steps.

Prime Factor Structure

Factorization String 2 × 3 × 11 × 28933

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 4,166,496

Proper Divisor Sum 2,256,918

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #1909573 ← → #1909603

Radix Representation

Decimal	1909578
Binary	111010010001101001010 (21 bits)
Octal	0o7221512
Hexadecimal	0x1D234A

Divisor Catalog (16)

1 2 3 6 11 22 33 66 28,933 57,866 86,799 173,598 318,263 636,526 954,789 1,909,578

Collatz Trajectory (78 steps to reach 1)

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

1,909,578 954,789 2,864,368 1,432,184 716,092 358,046 179,023 537,070 268,535 805,606 402,803 1,208,410 604,205 1,812,616 906,308 453,154 226,577 679,732 339,866 169,933 509,800 254,900 127,450 63,725 191,176 95,588 47,794 23,897 71,692 35,846 17,923 53,770 26,885 80,656 40,328 20,164 10,082 5,041 15,124 7,562 3,781 11,344 5,672 2,836 1,418 709 2,128 1,064 532 266 133 400 200 100 50 25 76 38 19 58

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,909,577 Browse Full Index Next Integer #1,909,579 →