3,914,328

2³ × 3 × 11 × 14827

3,914,328 factors as 2^3 × 3 × 11 × 14827. Its 32 positive divisors give a proper-divisor sum of 6,761,832, so this integer is abundant. The Collatz stopping time is 79 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 11 × 14827

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 10,676,160

Proper Divisor Sum 6,761,832

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3914327 ← → #3914329

Radix Representation

Decimal	3914328
Binary	1110111011101001011000 (22 bits)
Octal	0o16735130
Hexadecimal	0x3BBA58

Divisor Catalog (32)

1 2 3 4 6 8 11 12 22 24 33 44 66 88 132 264 14,827 29,654 44,481 59,308 88,962 118,616 163,097 177,924 326,194 355,848 489,291 652,388 978,582 1,304,776 1,957,164 3,914,328

Collatz Trajectory (79 steps to reach 1)

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

3,914,328 1,957,164 978,582 489,291 1,467,874 733,937 2,201,812 1,100,906 550,453 1,651,360 825,680 412,840 206,420 103,210 51,605 154,816 77,408 38,704 19,352 9,676 4,838 2,419 7,258 3,629 10,888 5,444 2,722 1,361 4,084 2,042 1,021 3,064 1,532 766 383 1,150 575 1,726 863 2,590 1,295 3,886 1,943 5,830 2,915 8,746 4,373 13,120 6,560 3,280 1,640 820 410 205 616 308 154 77 232 116

← Previous Integer #3,914,327 Browse Full Index Next Integer #3,914,329 →