5,788,552

2³ × 7 × 11 × 9397

5,788,552 factors as 2^3 × 7 × 11 × 9397. Its 32 positive divisors give a proper-divisor sum of 7,744,568, so this integer is abundant. The Collatz stopping time is 95 steps.

Prime Factor Structure

Factorization String 2^3 × 7 × 11 × 9397

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 13,533,120

Proper Divisor Sum 7,744,568

Digit Sum / Digital Root 40 (Root: 4)

Adjacent Primes #5788543 ← → #5788553

Radix Representation

Decimal	5788552
Binary	10110000101001110001000 (23 bits)
Octal	0o26051610
Hexadecimal	0x585388

Divisor Catalog (32)

1 2 4 7 8 11 14 22 28 44 56 77 88 154 308 616 9,397 18,794 37,588 65,779 75,176 103,367 131,558 206,734 263,116 413,468 526,232 723,569 826,936 1,447,138 2,894,276 5,788,552

Collatz Trajectory (95 steps to reach 1)

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

5,788,552 2,894,276 1,447,138 723,569 2,170,708 1,085,354 542,677 1,628,032 814,016 407,008 203,504 101,752 50,876 25,438 12,719 38,158 19,079 57,238 28,619 85,858 42,929 128,788 64,394 32,197 96,592 48,296 24,148 12,074 6,037 18,112 9,056 4,528 2,264 1,132 566 283 850 425 1,276 638 319 958 479 1,438 719 2,158 1,079 3,238 1,619 4,858 2,429 7,288 3,644 1,822 911 2,734 1,367 4,102 2,051 6,154

← Previous Integer #5,788,551 Browse Full Index Next Integer #5,788,553 →