4,328,922

2 × 3 × 13 × 19 × 23 × 127

4,328,922 factors as 2 × 3 × 13 × 19 × 23 × 127. Its 64 positive divisors give a proper-divisor sum of 5,992,998, so this integer is abundant. The Collatz stopping time is 123 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13 × 19 × 23 × 127

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 10,321,920

Proper Divisor Sum 5,992,998

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #4328921 ← → #4328923

Radix Representation

Decimal	4328922
Binary	10000100000110111011010 (23 bits)
Octal	0o20406732
Hexadecimal	0x420DDA

Divisor Catalog (60 of 64)

1 2 3 6 13 19 23 26 38 39 46 57 69 78 114 127 138 247 254 299 381 437 494 598 741 762 874 897 1,311 1,482 1,651 1,794 2,413 2,622 2,921 3,302 4,826 4,953 5,681 5,842 7,239 8,763 9,906 11,362 14,478 17,043 17,526 31,369 34,086 37,973 55,499 62,738 75,946 94,107 110,998 113,919 166,497 188,214 227,838 332,994

Collatz Trajectory (123 steps to reach 1)

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

4,328,922 2,164,461 6,493,384 3,246,692 1,623,346 811,673 2,435,020 1,217,510 608,755 1,826,266 913,133 2,739,400 1,369,700 684,850 342,425 1,027,276 513,638 256,819 770,458 385,229 1,155,688 577,844 288,922 144,461 433,384 216,692 108,346 54,173 162,520 81,260 40,630 20,315 60,946 30,473 91,420 45,710 22,855 68,566 34,283 102,850 51,425 154,276 77,138 38,569 115,708 57,854 28,927 86,782 43,391 130,174 65,087 195,262 97,631 292,894 146,447 439,342 219,671 659,014 329,507 988,522

← Previous Integer #4,328,921 Browse Full Index Next Integer #4,328,923 →