296,364

2² × 3 × 24697

296,364 factors as 2^2 × 3 × 24697. Its 12 positive divisors give a proper-divisor sum of 395,180, so this integer is abundant. The Collatz stopping time is 145 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 24697

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 691,544

Proper Divisor Sum 395,180

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #296363 ← → #296369

Radix Representation

Decimal	296364
Binary	1001000010110101100 (19 bits)
Octal	0o1102654
Hexadecimal	0x485AC

Divisor Catalog (12)

1 2 3 4 6 12 24,697 49,394 74,091 98,788 148,182 296,364

Collatz Trajectory (145 steps to reach 1)

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

296,364 148,182 74,091 222,274 111,137 333,412 166,706 83,353 250,060 125,030 62,515 187,546 93,773 281,320 140,660 70,330 35,165 105,496 52,748 26,374 13,187 39,562 19,781 59,344 29,672 14,836 7,418 3,709 11,128 5,564 2,782 1,391 4,174 2,087 6,262 3,131 9,394 4,697 14,092 7,046 3,523 10,570 5,285 15,856 7,928 3,964 1,982 991 2,974 1,487 4,462 2,231 6,694 3,347 10,042 5,021 15,064 7,532 3,766 1,883

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #296,363 Browse Full Index Next Integer #296,365 →