2,023,854

2 × 3 × 7 × 48187

2,023,854 factors as 2 × 3 × 7 × 48187. Its 16 positive divisors give a proper-divisor sum of 2,602,194, so this integer is abundant. The Collatz stopping time is 135 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 48187

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 4,626,048

Proper Divisor Sum 2,602,194

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #2023849 ← → #2023859

Radix Representation

Decimal	2023854
Binary	111101110000110101110 (21 bits)
Octal	0o7560656
Hexadecimal	0x1EE1AE

Divisor Catalog (16)

1 2 3 6 7 14 21 42 48,187 96,374 144,561 289,122 337,309 674,618 1,011,927 2,023,854

Collatz Trajectory (135 steps to reach 1)

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

2,023,854 1,011,927 3,035,782 1,517,891 4,553,674 2,276,837 6,830,512 3,415,256 1,707,628 853,814 426,907 1,280,722 640,361 1,921,084 960,542 480,271 1,440,814 720,407 2,161,222 1,080,611 3,241,834 1,620,917 4,862,752 2,431,376 1,215,688 607,844 303,922 151,961 455,884 227,942 113,971 341,914 170,957 512,872 256,436 128,218 64,109 192,328 96,164 48,082 24,041 72,124 36,062 18,031 54,094 27,047 81,142 40,571 121,714 60,857 182,572 91,286 45,643 136,930 68,465 205,396 102,698 51,349 154,048 77,024

← Previous Integer #2,023,853 Browse Full Index Next Integer #2,023,855 →