5,260,216

2³ × 13 × 37 × 1367

5,260,216 factors as 2^3 × 13 × 37 × 1367. Its 32 positive divisors give a proper-divisor sum of 5,656,424, so this integer is abundant. The Collatz stopping time is 294 steps.

Prime Factor Structure

Factorization String 2^3 × 13 × 37 × 1367

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 10,916,640

Proper Divisor Sum 5,656,424

Digit Sum / Digital Root 22 (Root: 4)

Adjacent Primes #5260187 ← → #5260219

Radix Representation

Decimal	5260216
Binary	10100000100001110111000 (23 bits)
Octal	0o24041670
Hexadecimal	0x5043B8

Divisor Catalog (32)

1 2 4 8 13 26 37 52 74 104 148 296 481 962 1,367 1,924 2,734 3,848 5,468 10,936 17,771 35,542 50,579 71,084 101,158 142,168 202,316 404,632 657,527 1,315,054 2,630,108 5,260,216

Collatz Trajectory (294 steps to reach 1)

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

5,260,216 2,630,108 1,315,054 657,527 1,972,582 986,291 2,958,874 1,479,437 4,438,312 2,219,156 1,109,578 554,789 1,664,368 832,184 416,092 208,046 104,023 312,070 156,035 468,106 234,053 702,160 351,080 175,540 87,770 43,885 131,656 65,828 32,914 16,457 49,372 24,686 12,343 37,030 18,515 55,546 27,773 83,320 41,660 20,830 10,415 31,246 15,623 46,870 23,435 70,306 35,153 105,460 52,730 26,365 79,096 39,548 19,774 9,887 29,662 14,831 44,494 22,247 66,742 33,371

← Previous Integer #5,260,215 Browse Full Index Next Integer #5,260,217 →