10,691,268

2² × 3 × 7 × 127277

10,691,268 factors as 2^2 × 3 × 7 × 127277. Its 24 positive divisors give a proper-divisor sum of 17,819,004, so this integer is abundant. The Collatz stopping time is 145 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 7 × 127277

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 28,510,272

Proper Divisor Sum 17,819,004

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #10691267 ← → #10691273

Radix Representation

Decimal	10691268
Binary	101000110010001011000100 (24 bits)
Octal	0o50621304
Hexadecimal	0xA322C4

Divisor Catalog (24)

Collatz Trajectory (145 steps to reach 1)

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

10,691,268 5,345,634 2,672,817 8,018,452 4,009,226 2,004,613 6,013,840 3,006,920 1,503,460 751,730 375,865 1,127,596 563,798 281,899 845,698 422,849 1,268,548 634,274 317,137 951,412 475,706 237,853 713,560 356,780 178,390 89,195 267,586 133,793 401,380 200,690 100,345 301,036 150,518 75,259 225,778 112,889 338,668 169,334 84,667 254,002 127,001 381,004 190,502 95,251 285,754 142,877 428,632 214,316 107,158 53,579 160,738 80,369 241,108 120,554 60,277 180,832 90,416 45,208 22,604 11,302

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #10,691,267 Browse Full Index Next Integer #10,691,269 →