5,201,574

2 × 3 × 7 × 271 × 457

5,201,574 factors as 2 × 3 × 7 × 271 × 457. Its 32 positive divisors give a proper-divisor sum of 6,757,722, so this integer is abundant. The Collatz stopping time is 100 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 271 × 457

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 11,959,296

Proper Divisor Sum 6,757,722

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #5201569 ← → #5201593

Radix Representation

Decimal	5201574
Binary	10011110101111010100110 (23 bits)
Octal	0o23657246
Hexadecimal	0x4F5EA6

Divisor Catalog (32)

1 2 3 6 7 14 21 42 271 457 542 813 914 1,371 1,626 1,897 2,742 3,199 3,794 5,691 6,398 9,597 11,382 19,194 123,847 247,694 371,541 743,082 866,929 1,733,858 2,600,787 5,201,574

Collatz Trajectory (100 steps to reach 1)

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

5,201,574 2,600,787 7,802,362 3,901,181 11,703,544 5,851,772 2,925,886 1,462,943 4,388,830 2,194,415 6,583,246 3,291,623 9,874,870 4,937,435 14,812,306 7,406,153 22,218,460 11,109,230 5,554,615 16,663,846 8,331,923 24,995,770 12,497,885 37,493,656 18,746,828 9,373,414 4,686,707 14,060,122 7,030,061 21,090,184 10,545,092 5,272,546 2,636,273 7,908,820 3,954,410 1,977,205 5,931,616 2,965,808 1,482,904 741,452 370,726 185,363 556,090 278,045 834,136 417,068 208,534 104,267 312,802 156,401 469,204 234,602 117,301 351,904 175,952 87,976 43,988 21,994 10,997 32,992

← Previous Integer #5,201,573 Browse Full Index Next Integer #5,201,575 →