5,771,868

2² × 3 × 480989

5,771,868 factors as 2^2 × 3 × 480989. Its 12 positive divisors give a proper-divisor sum of 7,695,852, so this integer is abundant. The Collatz stopping time is 214 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 480989

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 13,467,720

Proper Divisor Sum 7,695,852

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #5771863 ← → #5771869

Radix Representation

Decimal	5771868
Binary	10110000001001001011100 (23 bits)
Octal	0o26011134
Hexadecimal	0x58125C

Divisor Catalog (12)

1 2 3 4 6 12 480,989 961,978 1,442,967 1,923,956 2,885,934 5,771,868

Collatz Trajectory (214 steps to reach 1)

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

5,771,868 2,885,934 1,442,967 4,328,902 2,164,451 6,493,354 3,246,677 9,740,032 4,870,016 2,435,008 1,217,504 608,752 304,376 152,188 76,094 38,047 114,142 57,071 171,214 85,607 256,822 128,411 385,234 192,617 577,852 288,926 144,463 433,390 216,695 650,086 325,043 975,130 487,565 1,462,696 731,348 365,674 182,837 548,512 274,256 137,128 68,564 34,282 17,141 51,424 25,712 12,856 6,428 3,214 1,607 4,822 2,411 7,234 3,617 10,852 5,426 2,713 8,140 4,070 2,035 6,106

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #5,771,867 Browse Full Index Next Integer #5,771,869 →