11,680,565

5 × 13 × 71 × 2531

11,680,565 factors as 5 × 13 × 71 × 2531. Its 16 positive divisors give a proper-divisor sum of 3,632,971, so this integer is deficient. The Collatz stopping time is 65 steps.

Prime Factor Structure

Factorization String 5 × 13 × 71 × 2531

Distinct Prime Factors 4

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 15,313,536

Proper Divisor Sum 3,632,971

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #11680519 ← → #11680577

Radix Representation

Decimal	11680565
Binary	101100100011101100110101 (24 bits)
Octal	0o54435465
Hexadecimal	0xB23B35

Divisor Catalog (16)

1 5 13 65 71 355 923 2,531 4,615 12,655 32,903 164,515 179,701 898,505 2,336,113 11,680,565

Collatz Trajectory (65 steps to reach 1)

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

11,680,565 35,041,696 17,520,848 8,760,424 4,380,212 2,190,106 1,095,053 3,285,160 1,642,580 821,290 410,645 1,231,936 615,968 307,984 153,992 76,996 38,498 19,249 57,748 28,874 14,437 43,312 21,656 10,828 5,414 2,707 8,122 4,061 12,184 6,092 3,046 1,523 4,570 2,285 6,856 3,428 1,714 857 2,572 1,286 643 1,930 965 2,896 1,448 724 362 181 544 272 136 68 34 17 52 26 13 40 20 10

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #11,680,564 Browse Full Index Next Integer #11,680,566 →