11,628,660

2² × 3 × 5 × 193811

11,628,660 factors as 2^2 × 3 × 5 × 193811. Its 24 positive divisors give a proper-divisor sum of 20,931,756, so this integer is abundant. The Collatz stopping time is 96 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 5 × 193811

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 32,560,416

Proper Divisor Sum 20,931,756

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #11628641 ← → #11628667

Radix Representation

Decimal	11628660
Binary	101100010111000001110100 (24 bits)
Octal	0o54270164
Hexadecimal	0xB17074

Divisor Catalog (24)

Collatz Trajectory (96 steps to reach 1)

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

11,628,660 5,814,330 2,907,165 8,721,496 4,360,748 2,180,374 1,090,187 3,270,562 1,635,281 4,905,844 2,452,922 1,226,461 3,679,384 1,839,692 919,846 459,923 1,379,770 689,885 2,069,656 1,034,828 517,414 258,707 776,122 388,061 1,164,184 582,092 291,046 145,523 436,570 218,285 654,856 327,428 163,714 81,857 245,572 122,786 61,393 184,180 92,090 46,045 138,136 69,068 34,534 17,267 51,802 25,901 77,704 38,852 19,426 9,713 29,140 14,570 7,285 21,856 10,928 5,464 2,732 1,366 683 2,050

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #11,628,659 Browse Full Index Next Integer #11,628,661 →