5,297,810

2 × 5 × 7 × 75683

5,297,810 factors as 2 × 5 × 7 × 75683. Its 16 positive divisors give a proper-divisor sum of 5,600,686, so this integer is abundant. The Collatz stopping time is 188 steps.

Prime Factor Structure

Factorization String 2 × 5 × 7 × 75683

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 10,898,496

Proper Divisor Sum 5,600,686

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #5297759 ← → #5297813

Radix Representation

Decimal	5297810
Binary	10100001101011010010010 (23 bits)
Octal	0o24153222
Hexadecimal	0x50D692

Divisor Catalog (16)

1 2 5 7 10 14 35 70 75,683 151,366 378,415 529,781 756,830 1,059,562 2,648,905 5,297,810

Collatz Trajectory (188 steps to reach 1)

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

5,297,810 2,648,905 7,946,716 3,973,358 1,986,679 5,960,038 2,980,019 8,940,058 4,470,029 13,410,088 6,705,044 3,352,522 1,676,261 5,028,784 2,514,392 1,257,196 628,598 314,299 942,898 471,449 1,414,348 707,174 353,587 1,060,762 530,381 1,591,144 795,572 397,786 198,893 596,680 298,340 149,170 74,585 223,756 111,878 55,939 167,818 83,909 251,728 125,864 62,932 31,466 15,733 47,200 23,600 11,800 5,900 2,950 1,475 4,426 2,213 6,640 3,320 1,660 830 415 1,246 623 1,870 935

← Previous Integer #5,297,809 Browse Full Index Next Integer #5,297,811 →