5,029,194

2 × 3 × 43 × 101 × 193

5,029,194 factors as 2 × 3 × 43 × 101 × 193. Its 32 positive divisors give a proper-divisor sum of 5,418,870, so this integer is abundant. The Collatz stopping time is 113 steps.

Prime Factor Structure

Factorization String 2 × 3 × 43 × 101 × 193

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 10,448,064

Proper Divisor Sum 5,418,870

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #5029187 ← → #5029201

Radix Representation

Decimal	5029194
Binary	10011001011110101001010 (23 bits)
Octal	0o23136512
Hexadecimal	0x4CBD4A

Divisor Catalog (32)

1 2 3 6 43 86 101 129 193 202 258 303 386 579 606 1,158 4,343 8,299 8,686 13,029 16,598 19,493 24,897 26,058 38,986 49,794 58,479 116,958 838,199 1,676,398 2,514,597 5,029,194

Collatz Trajectory (113 steps to reach 1)

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

5,029,194 2,514,597 7,543,792 3,771,896 1,885,948 942,974 471,487 1,414,462 707,231 2,121,694 1,060,847 3,182,542 1,591,271 4,773,814 2,386,907 7,160,722 3,580,361 10,741,084 5,370,542 2,685,271 8,055,814 4,027,907 12,083,722 6,041,861 18,125,584 9,062,792 4,531,396 2,265,698 1,132,849 3,398,548 1,699,274 849,637 2,548,912 1,274,456 637,228 318,614 159,307 477,922 238,961 716,884 358,442 179,221 537,664 268,832 134,416 67,208 33,604 16,802 8,401 25,204 12,602 6,301 18,904 9,452 4,726 2,363 7,090 3,545 10,636 5,318

← Previous Integer #5,029,193 Browse Full Index Next Integer #5,029,195 →