2,361,888

2⁵ × 3² × 59 × 139

2,361,888 factors as 2^5 × 3^2 × 59 × 139. Its 72 positive divisors give a proper-divisor sum of 4,517,712, so this integer is abundant. The Collatz stopping time is 236 steps.

Prime Factor Structure

Factorization String 2^5 × 3^2 × 59 × 139

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 72

Divisor Sum (σ) 6,879,600

Proper Divisor Sum 4,517,712

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #2361883 ← → #2361899

Radix Representation

Decimal	2361888
Binary	1001000000101000100000 (22 bits)
Octal	0o11005040
Hexadecimal	0x240A20

Divisor Catalog (60 of 72)

1 2 3 4 6 8 9 12 16 18 24 32 36 48 59 72 96 118 139 144 177 236 278 288 354 417 472 531 556 708 834 944 1,062 1,112 1,251 1,416 1,668 1,888 2,124 2,224 2,502 2,832 3,336 4,248 4,448 5,004 5,664 6,672 8,201 8,496 10,008 13,344 16,402 16,992 20,016 24,603 32,804 40,032 49,206 65,608

Collatz Trajectory (236 steps to reach 1)

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

2,361,888 1,180,944 590,472 295,236 147,618 73,809 221,428 110,714 55,357 166,072 83,036 41,518 20,759 62,278 31,139 93,418 46,709 140,128 70,064 35,032 17,516 8,758 4,379 13,138 6,569 19,708 9,854 4,927 14,782 7,391 22,174 11,087 33,262 16,631 49,894 24,947 74,842 37,421 112,264 56,132 28,066 14,033 42,100 21,050 10,525 31,576 15,788 7,894 3,947 11,842 5,921 17,764 8,882 4,441 13,324 6,662 3,331 9,994 4,997 14,992

← Previous Integer #2,361,887 Browse Full Index Next Integer #2,361,889 →