892,242

2 × 3³ × 13 × 31 × 41

892,242 factors as 2 × 3^3 × 13 × 31 × 41. Its 64 positive divisors give a proper-divisor sum of 1,365,678, so this integer is abundant. The Collatz stopping time is 263 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 13 × 31 × 41

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 2,257,920

Proper Divisor Sum 1,365,678

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #892237 ← → #892249

Radix Representation

Decimal	892242
Binary	11011001110101010010 (20 bits)
Octal	0o3316522
Hexadecimal	0xD9D52

Divisor Catalog (60 of 64)

1 2 3 6 9 13 18 26 27 31 39 41 54 62 78 82 93 117 123 186 234 246 279 351 369 403 533 558 702 738 806 837 1,066 1,107 1,209 1,271 1,599 1,674 2,214 2,418 2,542 3,198 3,627 3,813 4,797 7,254 7,626 9,594 10,881 11,439 14,391 16,523 21,762 22,878 28,782 33,046 34,317 49,569 68,634 99,138

Collatz Trajectory (263 steps to reach 1)

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

892,242 446,121 1,338,364 669,182 334,591 1,003,774 501,887 1,505,662 752,831 2,258,494 1,129,247 3,387,742 1,693,871 5,081,614 2,540,807 7,622,422 3,811,211 11,433,634 5,716,817 17,150,452 8,575,226 4,287,613 12,862,840 6,431,420 3,215,710 1,607,855 4,823,566 2,411,783 7,235,350 3,617,675 10,853,026 5,426,513 16,279,540 8,139,770 4,069,885 12,209,656 6,104,828 3,052,414 1,526,207 4,578,622 2,289,311 6,867,934 3,433,967 10,301,902 5,150,951 15,452,854 7,726,427 23,179,282 11,589,641 34,768,924 17,384,462 8,692,231 26,076,694 13,038,347 39,115,042 19,557,521 58,672,564 29,336,282 14,668,141 44,004,424

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #892,241 Browse Full Index Next Integer #892,243 →