3,928,568

2³ × 7 × 31² × 73

3,928,568 factors as 2^3 × 7 × 31^2 × 73. Its 48 positive divisors give a proper-divisor sum of 4,889,272, so this integer is abundant. The Collatz stopping time is 123 steps.

Prime Factor Structure

Factorization String 2^3 × 7 × 31^2 × 73

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 8,817,840

Proper Divisor Sum 4,889,272

Digit Sum / Digital Root 41 (Root: 5)

Adjacent Primes #3928553 ← → #3928577

Radix Representation

Decimal	3928568
Binary	1110111111000111111000 (22 bits)
Octal	0o16770770
Hexadecimal	0x3BF1F8

Divisor Catalog (48)

1 2 4 7 8 14 28 31 56 62 73 124 146 217 248 292 434 511 584 868 961 1,022 1,736 1,922 2,044 2,263 3,844 4,088 4,526 6,727 7,688 9,052 13,454 15,841 18,104 26,908 31,682 53,816 63,364 70,153 126,728 140,306 280,612 491,071 561,224 982,142 1,964,284 3,928,568

Collatz Trajectory (123 steps to reach 1)

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

3,928,568 1,964,284 982,142 491,071 1,473,214 736,607 2,209,822 1,104,911 3,314,734 1,657,367 4,972,102 2,486,051 7,458,154 3,729,077 11,187,232 5,593,616 2,796,808 1,398,404 699,202 349,601 1,048,804 524,402 262,201 786,604 393,302 196,651 589,954 294,977 884,932 442,466 221,233 663,700 331,850 165,925 497,776 248,888 124,444 62,222 31,111 93,334 46,667 140,002 70,001 210,004 105,002 52,501 157,504 78,752 39,376 19,688 9,844 4,922 2,461 7,384 3,692 1,846 923 2,770 1,385 4,156

← Previous Integer #3,928,567 Browse Full Index Next Integer #3,928,569 →