52,596,570

2 × 3 × 5 × 13 × 157 × 859

52,596,570 factors as 2 × 3 × 5 × 13 × 157 × 859. Its 64 positive divisors give a proper-divisor sum of 84,370,470, so this integer is abundant. The Collatz stopping time is 212 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 13 × 157 × 859

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 136,967,040

Proper Divisor Sum 84,370,470

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #52596569 ← → #52596613

Radix Representation

Decimal	52596570
Binary	11001000101000111101011010 (26 bits)
Octal	0o310507532
Hexadecimal	0x3228F5A

Divisor Catalog (60 of 64)

1 2 3 5 6 10 13 15 26 30 39 65 78 130 157 195 314 390 471 785 859 942 1,570 1,718 2,041 2,355 2,577 4,082 4,295 4,710 5,154 6,123 8,590 10,205 11,167 12,246 12,885 20,410 22,334 25,770 30,615 33,501 55,835 61,230 67,002 111,670 134,863 167,505 269,726 335,010 404,589 674,315 809,178 1,348,630 1,753,219 2,022,945 3,506,438 4,045,890 5,259,657 8,766,095

Collatz Trajectory (212 steps to reach 1)

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

52,596,570 26,298,285 78,894,856 39,447,428 19,723,714 9,861,857 29,585,572 14,792,786 7,396,393 22,189,180 11,094,590 5,547,295 16,641,886 8,320,943 24,962,830 12,481,415 37,444,246 18,722,123 56,166,370 28,083,185 84,249,556 42,124,778 21,062,389 63,187,168 31,593,584 15,796,792 7,898,396 3,949,198 1,974,599 5,923,798 2,961,899 8,885,698 4,442,849 13,328,548 6,664,274 3,332,137 9,996,412 4,998,206 2,499,103 7,497,310 3,748,655 11,245,966 5,622,983 16,868,950 8,434,475 25,303,426 12,651,713 37,955,140 18,977,570 9,488,785 28,466,356 14,233,178 7,116,589 21,349,768 10,674,884 5,337,442 2,668,721 8,006,164 4,003,082 2,001,541

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #52,596,569 Browse Full Index Next Integer #52,596,571 →