5,378,658

2 × 3 × 896443

5,378,658 factors as 2 × 3 × 896443. Its 8 positive divisors give a proper-divisor sum of 5,378,670, so this integer is abundant. The Collatz stopping time is 95 steps.

Prime Factor Structure

Factorization String 2 × 3 × 896443

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 10,757,328

Proper Divisor Sum 5,378,670

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #5378657 ← → #5378669

Radix Representation

Decimal	5378658
Binary	10100100001001001100010 (23 bits)
Octal	0o24411142
Hexadecimal	0x521262

Divisor Catalog (8)

1 2 3 6 896,443 1,792,886 2,689,329 5,378,658

Collatz Trajectory (95 steps to reach 1)

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

5,378,658 2,689,329 8,067,988 4,033,994 2,016,997 6,050,992 3,025,496 1,512,748 756,374 378,187 1,134,562 567,281 1,701,844 850,922 425,461 1,276,384 638,192 319,096 159,548 79,774 39,887 119,662 59,831 179,494 89,747 269,242 134,621 403,864 201,932 100,966 50,483 151,450 75,725 227,176 113,588 56,794 28,397 85,192 42,596 21,298 10,649 31,948 15,974 7,987 23,962 11,981 35,944 17,972 8,986 4,493 13,480 6,740 3,370 1,685 5,056 2,528 1,264 632 316 158

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #5,378,657 Browse Full Index Next Integer #5,378,659 →