2,256,306

2 × 3 × 13 × 28927

2,256,306 factors as 2 × 3 × 13 × 28927. Its 16 positive divisors give a proper-divisor sum of 2,603,598, so this integer is abundant. The Collatz stopping time is 60 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13 × 28927

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 4,859,904

Proper Divisor Sum 2,603,598

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #2256299 ← → #2256311

Radix Representation

Decimal	2256306
Binary	1000100110110110110010 (22 bits)
Octal	0o10466662
Hexadecimal	0x226DB2

Divisor Catalog (16)

1 2 3 6 13 26 39 78 28,927 57,854 86,781 173,562 376,051 752,102 1,128,153 2,256,306

Collatz Trajectory (60 steps to reach 1)

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

2,256,306 1,128,153 3,384,460 1,692,230 846,115 2,538,346 1,269,173 3,807,520 1,903,760 951,880 475,940 237,970 118,985 356,956 178,478 89,239 267,718 133,859 401,578 200,789 602,368 301,184 150,592 75,296 37,648 18,824 9,412 4,706 2,353 7,060 3,530 1,765 5,296 2,648 1,324 662 331 994 497 1,492 746 373 1,120 560 280 140 70 35 106 53 160 80 40 20 10 5 16 8 4 2

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,256,305 Browse Full Index Next Integer #2,256,307 →