256,218

2 × 3 × 42703

256,218 factors as 2 × 3 × 42703. Its 8 positive divisors give a proper-divisor sum of 256,230, so this integer is abundant. The Collatz stopping time is 256 steps.

Prime Factor Structure

Factorization String 2 × 3 × 42703

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 512,448

Proper Divisor Sum 256,230

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #256211 ← → #256219

Radix Representation

Decimal	256218
Binary	111110100011011010 (18 bits)
Octal	0o764332
Hexadecimal	0x3E8DA

Divisor Catalog (8)

1 2 3 6 42,703 85,406 128,109 256,218

Collatz Trajectory (256 steps to reach 1)

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

256,218 128,109 384,328 192,164 96,082 48,041 144,124 72,062 36,031 108,094 54,047 162,142 81,071 243,214 121,607 364,822 182,411 547,234 273,617 820,852 410,426 205,213 615,640 307,820 153,910 76,955 230,866 115,433 346,300 173,150 86,575 259,726 129,863 389,590 194,795 584,386 292,193 876,580 438,290 219,145 657,436 328,718 164,359 493,078 246,539 739,618 369,809 1,109,428 554,714 277,357 832,072 416,036 208,018 104,009 312,028 156,014 78,007 234,022 117,011 351,034

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #256,217 Browse Full Index Next Integer #256,219 →