3,889,928

2³ × 7 × 69463

3,889,928 factors as 2^3 × 7 × 69463. Its 16 positive divisors give a proper-divisor sum of 4,445,752, so this integer is abundant. The Collatz stopping time is 247 steps.

Prime Factor Structure

Factorization String 2^3 × 7 × 69463

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 8,335,680

Proper Divisor Sum 4,445,752

Digit Sum / Digital Root 47 (Root: 2)

Adjacent Primes #3889913 ← → #3889933

Radix Representation

Decimal	3889928
Binary	1110110101101100001000 (22 bits)
Octal	0o16655410
Hexadecimal	0x3B5B08

Divisor Catalog (16)

1 2 4 7 8 14 28 56 69,463 138,926 277,852 486,241 555,704 972,482 1,944,964 3,889,928

Collatz Trajectory (247 steps to reach 1)

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

3,889,928 1,944,964 972,482 486,241 1,458,724 729,362 364,681 1,094,044 547,022 273,511 820,534 410,267 1,230,802 615,401 1,846,204 923,102 461,551 1,384,654 692,327 2,076,982 1,038,491 3,115,474 1,557,737 4,673,212 2,336,606 1,168,303 3,504,910 1,752,455 5,257,366 2,628,683 7,886,050 3,943,025 11,829,076 5,914,538 2,957,269 8,871,808 4,435,904 2,217,952 1,108,976 554,488 277,244 138,622 69,311 207,934 103,967 311,902 155,951 467,854 233,927 701,782 350,891 1,052,674 526,337 1,579,012 789,506 394,753 1,184,260 592,130 296,065 888,196

← Previous Integer #3,889,927 Browse Full Index Next Integer #3,889,929 →