5,771,268

2² × 3² × 160313

5,771,268 factors as 2^2 × 3^2 × 160313. Its 18 positive divisors give a proper-divisor sum of 8,817,306, so this integer is abundant. The Collatz stopping time is 69 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 160313

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 18

Divisor Sum (σ) 14,588,574

Proper Divisor Sum 8,817,306

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #5771267 ← → #5771281

Radix Representation

Decimal	5771268
Binary	10110000001000000000100 (23 bits)
Octal	0o26010004
Hexadecimal	0x581004

Divisor Catalog (18)

1 2 3 4 6 9 12 18 36 160,313 320,626 480,939 641,252 961,878 1,442,817 1,923,756 2,885,634 5,771,268

Collatz Trajectory (69 steps to reach 1)

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

5,771,268 2,885,634 1,442,817 4,328,452 2,164,226 1,082,113 3,246,340 1,623,170 811,585 2,434,756 1,217,378 608,689 1,826,068 913,034 456,517 1,369,552 684,776 342,388 171,194 85,597 256,792 128,396 64,198 32,099 96,298 48,149 144,448 72,224 36,112 18,056 9,028 4,514 2,257 6,772 3,386 1,693 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,771,267 Browse Full Index Next Integer #5,771,269 →