294,222

2 × 3 × 49037

294,222 factors as 2 × 3 × 49037. Its 8 positive divisors give a proper-divisor sum of 294,234, so this integer is abundant. The Collatz stopping time is 127 steps.

Prime Factor Structure

Factorization String 2 × 3 × 49037

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 588,456

Proper Divisor Sum 294,234

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #294211 ← → #294223

Radix Representation

Decimal	294222
Binary	1000111110101001110 (19 bits)
Octal	0o1076516
Hexadecimal	0x47D4E

Divisor Catalog (8)

1 2 3 6 49,037 98,074 147,111 294,222

Collatz Trajectory (127 steps to reach 1)

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

294,222 147,111 441,334 220,667 662,002 331,001 993,004 496,502 248,251 744,754 372,377 1,117,132 558,566 279,283 837,850 418,925 1,256,776 628,388 314,194 157,097 471,292 235,646 117,823 353,470 176,735 530,206 265,103 795,310 397,655 1,192,966 596,483 1,789,450 894,725 2,684,176 1,342,088 671,044 335,522 167,761 503,284 251,642 125,821 377,464 188,732 94,366 47,183 141,550 70,775 212,326 106,163 318,490 159,245 477,736 238,868 119,434 59,717 179,152 89,576 44,788 22,394 11,197

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #294,221 Browse Full Index Next Integer #294,223 →