53,365,110

2 × 3 × 5 × 19 × 251 × 373

53,365,110 factors as 2 × 3 × 5 × 19 × 251 × 373. Its 64 positive divisors give a proper-divisor sum of 82,352,010, so this integer is abundant. The Collatz stopping time is 225 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 19 × 251 × 373

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 135,717,120

Proper Divisor Sum 82,352,010

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #53365033 ← → #53365111

Radix Representation

Decimal	53365110
Binary	11001011100100100101110110 (26 bits)
Octal	0o313444566
Hexadecimal	0x32E4976

Divisor Catalog (60 of 64)

1 2 3 5 6 10 15 19 30 38 57 95 114 190 251 285 373 502 570 746 753 1,119 1,255 1,506 1,865 2,238 2,510 3,730 3,765 4,769 5,595 7,087 7,530 9,538 11,190 14,174 14,307 21,261 23,845 28,614 35,435 42,522 47,690 70,870 71,535 93,623 106,305 143,070 187,246 212,610 280,869 468,115 561,738 936,230 1,404,345 1,778,837 2,808,690 3,557,674 5,336,511 8,894,185

Collatz Trajectory (225 steps to reach 1)

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

53,365,110 26,682,555 80,047,666 40,023,833 120,071,500 60,035,750 30,017,875 90,053,626 45,026,813 135,080,440 67,540,220 33,770,110 16,885,055 50,655,166 25,327,583 75,982,750 37,991,375 113,974,126 56,987,063 170,961,190 85,480,595 256,441,786 128,220,893 384,662,680 192,331,340 96,165,670 48,082,835 144,248,506 72,124,253 216,372,760 108,186,380 54,093,190 27,046,595 81,139,786 40,569,893 121,709,680 60,854,840 30,427,420 15,213,710 7,606,855 22,820,566 11,410,283 34,230,850 17,115,425 51,346,276 25,673,138 12,836,569 38,509,708 19,254,854 9,627,427 28,882,282 14,441,141 43,323,424 21,661,712 10,830,856 5,415,428 2,707,714 1,353,857 4,061,572 2,030,786

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #53,365,109 Browse Full Index Next Integer #53,365,111 →