5,206,696

2³ × 11 × 59167

5,206,696 factors as 2^3 × 11 × 59167. Its 16 positive divisors give a proper-divisor sum of 5,443,544, so this integer is abundant. The Collatz stopping time is 95 steps.

Prime Factor Structure

Factorization String 2^3 × 11 × 59167

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 10,650,240

Proper Divisor Sum 5,443,544

Digit Sum / Digital Root 34 (Root: 7)

Adjacent Primes #5206687 ← → #5206711

Radix Representation

Decimal	5206696
Binary	10011110111001010101000 (23 bits)
Octal	0o23671250
Hexadecimal	0x4F72A8

Divisor Catalog (16)

1 2 4 8 11 22 44 88 59,167 118,334 236,668 473,336 650,837 1,301,674 2,603,348 5,206,696

Collatz Trajectory (95 steps to reach 1)

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

5,206,696 2,603,348 1,301,674 650,837 1,952,512 976,256 488,128 244,064 122,032 61,016 30,508 15,254 7,627 22,882 11,441 34,324 17,162 8,581 25,744 12,872 6,436 3,218 1,609 4,828 2,414 1,207 3,622 1,811 5,434 2,717 8,152 4,076 2,038 1,019 3,058 1,529 4,588 2,294 1,147 3,442 1,721 5,164 2,582 1,291 3,874 1,937 5,812 2,906 1,453 4,360 2,180 1,090 545 1,636 818 409 1,228 614 307 922

← Previous Integer #5,206,695 Browse Full Index Next Integer #5,206,697 →