268,608

2⁶ × 3 × 1399

268,608 factors as 2^6 × 3 × 1399. Its 28 positive divisors give a proper-divisor sum of 442,592, so this integer is abundant. The Collatz stopping time is 70 steps.

Prime Factor Structure

Factorization String 2^6 × 3 × 1399

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 28

Divisor Sum (σ) 711,200

Proper Divisor Sum 442,592

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #268607 ← → #268613

Radix Representation

Decimal	268608
Binary	1000001100101000000 (19 bits)
Octal	0o1014500
Hexadecimal	0x41940

Divisor Catalog (28)

1 2 3 4 6 8 12 16 24 32 48 64 96 192 1,399 2,798 4,197 5,596 8,394 11,192 16,788 22,384 33,576 44,768 67,152 89,536 134,304 268,608

Collatz Trajectory (70 steps to reach 1)

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

268,608 134,304 67,152 33,576 16,788 8,394 4,197 12,592 6,296 3,148 1,574 787 2,362 1,181 3,544 1,772 886 443 1,330 665 1,996 998 499 1,498 749 2,248 1,124 562 281 844 422 211 634 317 952 476 238 119 358 179 538 269 808 404 202 101 304 152 76 38 19 58 29 88 44 22 11 34 17 52

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #268,607 Browse Full Index Next Integer #268,609 →