11,680,518

2 × 3 × 269 × 7237

11,680,518 factors as 2 × 3 × 269 × 7237. Its 16 positive divisors give a proper-divisor sum of 11,770,602, so this integer is abundant. The Collatz stopping time is 65 steps.

Prime Factor Structure

Factorization String 2 × 3 × 269 × 7237

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 23,451,120

Proper Divisor Sum 11,770,602

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #11680489 ← → #11680519

Radix Representation

Decimal	11680518
Binary	101100100011101100000110 (24 bits)
Octal	0o54435406
Hexadecimal	0xB23B06

Divisor Catalog (16)

1 2 3 6 269 538 807 1,614 7,237 14,474 21,711 43,422 1,946,753 3,893,506 5,840,259 11,680,518

Collatz Trajectory (65 steps to reach 1)

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

11,680,518 5,840,259 17,520,778 8,760,389 26,281,168 13,140,584 6,570,292 3,285,146 1,642,573 4,927,720 2,463,860 1,231,930 615,965 1,847,896 923,948 461,974 230,987 692,962 346,481 1,039,444 519,722 259,861 779,584 389,792 194,896 97,448 48,724 24,362 12,181 36,544 18,272 9,136 4,568 2,284 1,142 571 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,517 Browse Full Index Next Integer #11,680,519 →