2,868,888

2³ × 3 × 11 × 10867

2,868,888 factors as 2^3 × 3 × 11 × 10867. Its 32 positive divisors give a proper-divisor sum of 4,956,072, so this integer is abundant. The Collatz stopping time is 169 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 11 × 10867

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 7,824,960

Proper Divisor Sum 4,956,072

Digit Sum / Digital Root 48 (Root: 3)

Adjacent Primes #2868871 ← → #2868919

Radix Representation

Decimal	2868888
Binary	1010111100011010011000 (22 bits)
Octal	0o12743230
Hexadecimal	0x2BC698

Divisor Catalog (32)

1 2 3 4 6 8 11 12 22 24 33 44 66 88 132 264 10,867 21,734 32,601 43,468 65,202 86,936 119,537 130,404 239,074 260,808 358,611 478,148 717,222 956,296 1,434,444 2,868,888

Collatz Trajectory (169 steps to reach 1)

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

2,868,888 1,434,444 717,222 358,611 1,075,834 537,917 1,613,752 806,876 403,438 201,719 605,158 302,579 907,738 453,869 1,361,608 680,804 340,402 170,201 510,604 255,302 127,651 382,954 191,477 574,432 287,216 143,608 71,804 35,902 17,951 53,854 26,927 80,782 40,391 121,174 60,587 181,762 90,881 272,644 136,322 68,161 204,484 102,242 51,121 153,364 76,682 38,341 115,024 57,512 28,756 14,378 7,189 21,568 10,784 5,392 2,696 1,348 674 337 1,012 506

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