5,772,948

2² × 3 × 139 × 3461

5,772,948 factors as 2^2 × 3 × 139 × 3461. Its 24 positive divisors give a proper-divisor sum of 7,798,092, so this integer is abundant. The Collatz stopping time is 69 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 139 × 3461

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 13,571,040

Proper Divisor Sum 7,798,092

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #5772889 ← → #5772953

Radix Representation

Decimal	5772948
Binary	10110000001011010010100 (23 bits)
Octal	0o26013224
Hexadecimal	0x581694

Divisor Catalog (24)

Collatz Trajectory (69 steps to reach 1)

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

5,772,948 2,886,474 1,443,237 4,329,712 2,164,856 1,082,428 541,214 270,607 811,822 405,911 1,217,734 608,867 1,826,602 913,301 2,739,904 1,369,952 684,976 342,488 171,244 85,622 42,811 128,434 64,217 192,652 96,326 48,163 144,490 72,245 216,736 108,368 54,184 27,092 13,546 6,773 20,320 10,160 5,080 2,540 1,270 635 1,906 953 2,860 1,430 715 2,146 1,073 3,220 1,610 805 2,416 1,208 604 302 151 454 227 682 341 1,024

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #5,772,947 Browse Full Index Next Integer #5,772,949 →