5,196,348

2² × 3² × 19 × 71 × 107

5,196,348 factors as 2^2 × 3^2 × 19 × 71 × 107. Its 72 positive divisors give a proper-divisor sum of 8,955,972, so this integer is abundant. The Collatz stopping time is 100 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 19 × 71 × 107

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 72

Divisor Sum (σ) 14,152,320

Proper Divisor Sum 8,955,972

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #5196343 ← → #5196361

Radix Representation

Decimal	5196348
Binary	10011110100101000111100 (23 bits)
Octal	0o23645074
Hexadecimal	0x4F4A3C

Divisor Catalog (60 of 72)

1 2 3 4 6 9 12 18 19 36 38 57 71 76 107 114 142 171 213 214 228 284 321 342 426 428 639 642 684 852 963 1,278 1,284 1,349 1,926 2,033 2,556 2,698 3,852 4,047 4,066 5,396 6,099 7,597 8,094 8,132 12,141 12,198 15,194 16,188 18,297 22,791 24,282 24,396 30,388 36,594 45,582 48,564 68,373 73,188

Collatz Trajectory (100 steps to reach 1)

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

5,196,348 2,598,174 1,299,087 3,897,262 1,948,631 5,845,894 2,922,947 8,768,842 4,384,421 13,153,264 6,576,632 3,288,316 1,644,158 822,079 2,466,238 1,233,119 3,699,358 1,849,679 5,549,038 2,774,519 8,323,558 4,161,779 12,485,338 6,242,669 18,728,008 9,364,004 4,682,002 2,341,001 7,023,004 3,511,502 1,755,751 5,267,254 2,633,627 7,900,882 3,950,441 11,851,324 5,925,662 2,962,831 8,888,494 4,444,247 13,332,742 6,666,371 19,999,114 9,999,557 29,998,672 14,999,336 7,499,668 3,749,834 1,874,917 5,624,752 2,812,376 1,406,188 703,094 351,547 1,054,642 527,321 1,581,964 790,982 395,491 1,186,474

← Previous Integer #5,196,347 Browse Full Index Next Integer #5,196,349 →