5,791,530

2 × 3 × 5 × 193051

5,791,530 factors as 2 × 3 × 5 × 193051. Its 16 positive divisors give a proper-divisor sum of 8,108,214, so this integer is abundant. The Collatz stopping time is 95 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 193051

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 13,899,744

Proper Divisor Sum 8,108,214

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #5791517 ← → #5791531

Radix Representation

Decimal	5791530
Binary	10110000101111100101010 (23 bits)
Octal	0o26057452
Hexadecimal	0x585F2A

Divisor Catalog (16)

1 2 3 5 6 10 15 30 193,051 386,102 579,153 965,255 1,158,306 1,930,510 2,895,765 5,791,530

Collatz Trajectory (95 steps to reach 1)

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

5,791,530 2,895,765 8,687,296 4,343,648 2,171,824 1,085,912 542,956 271,478 135,739 407,218 203,609 610,828 305,414 152,707 458,122 229,061 687,184 343,592 171,796 85,898 42,949 128,848 64,424 32,212 16,106 8,053 24,160 12,080 6,040 3,020 1,510 755 2,266 1,133 3,400 1,700 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

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #5,791,529 Browse Full Index Next Integer #5,791,531 →