1,442,292

2² × 3 × 263 × 457

1,442,292 factors as 2^2 × 3 × 263 × 457. Its 24 positive divisors give a proper-divisor sum of 1,943,244, so this integer is abundant. The Collatz stopping time is 168 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 263 × 457

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 3,385,536

Proper Divisor Sum 1,943,244

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #1442279 ← → #1442299

Radix Representation

Decimal	1442292
Binary	101100000000111110100 (21 bits)
Octal	0o5400764
Hexadecimal	0x1601F4

Divisor Catalog (24)

Collatz Trajectory (168 steps to reach 1)

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

1,442,292 721,146 360,573 1,081,720 540,860 270,430 135,215 405,646 202,823 608,470 304,235 912,706 456,353 1,369,060 684,530 342,265 1,026,796 513,398 256,699 770,098 385,049 1,155,148 577,574 288,787 866,362 433,181 1,299,544 649,772 324,886 162,443 487,330 243,665 730,996 365,498 182,749 548,248 274,124 137,062 68,531 205,594 102,797 308,392 154,196 77,098 38,549 115,648 57,824 28,912 14,456 7,228 3,614 1,807 5,422 2,711 8,134 4,067 12,202 6,101 18,304 9,152

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,442,291 Browse Full Index Next Integer #1,442,293 →