88,560,690

2 × 3 × 5 × 47 × 107 × 587

88,560,690 factors as 2 × 3 × 5 × 47 × 107 × 587. Its 64 positive divisors give a proper-divisor sum of 130,909,134, so this integer is abundant. The Collatz stopping time is 166 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 47 × 107 × 587

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 219,469,824

Proper Divisor Sum 130,909,134

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #88560677 ← → #88560727

Radix Representation

Decimal	88560690
Binary	101010001110101010000110010 (27 bits)
Octal	0o521652062
Hexadecimal	0x5475432

Divisor Catalog (60 of 64)

1 2 3 5 6 10 15 30 47 94 107 141 214 235 282 321 470 535 587 642 705 1,070 1,174 1,410 1,605 1,761 2,935 3,210 3,522 5,029 5,870 8,805 10,058 15,087 17,610 25,145 27,589 30,174 50,290 55,178 62,809 75,435 82,767 125,618 137,945 150,870 165,534 188,427 275,890 314,045 376,854 413,835 628,090 827,670 942,135 1,884,270 2,952,023 5,904,046 8,856,069 14,760,115

Collatz Trajectory (166 steps to reach 1)

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

88,560,690 44,280,345 132,841,036 66,420,518 33,210,259 99,630,778 49,815,389 149,446,168 74,723,084 37,361,542 18,680,771 56,042,314 28,021,157 84,063,472 42,031,736 21,015,868 10,507,934 5,253,967 15,761,902 7,880,951 23,642,854 11,821,427 35,464,282 17,732,141 53,196,424 26,598,212 13,299,106 6,649,553 19,948,660 9,974,330 4,987,165 14,961,496 7,480,748 3,740,374 1,870,187 5,610,562 2,805,281 8,415,844 4,207,922 2,103,961 6,311,884 3,155,942 1,577,971 4,733,914 2,366,957 7,100,872 3,550,436 1,775,218 887,609 2,662,828 1,331,414 665,707 1,997,122 998,561 2,995,684 1,497,842 748,921 2,246,764 1,123,382 561,691

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #88,560,689 Browse Full Index Next Integer #88,560,691 →