2,336,802

2 × 3 × 13 × 29959

2,336,802 factors as 2 × 3 × 13 × 29959. Its 16 positive divisors give a proper-divisor sum of 2,696,478, so this integer is abundant. The Collatz stopping time is 148 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13 × 29959

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 5,033,280

Proper Divisor Sum 2,696,478

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #2336801 ← → #2336821

Radix Representation

Decimal	2336802
Binary	1000111010100000100010 (22 bits)
Octal	0o10724042
Hexadecimal	0x23A822

Divisor Catalog (16)

1 2 3 6 13 26 39 78 29,959 59,918 89,877 179,754 389,467 778,934 1,168,401 2,336,802

Collatz Trajectory (148 steps to reach 1)

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

2,336,802 1,168,401 3,505,204 1,752,602 876,301 2,628,904 1,314,452 657,226 328,613 985,840 492,920 246,460 123,230 61,615 184,846 92,423 277,270 138,635 415,906 207,953 623,860 311,930 155,965 467,896 233,948 116,974 58,487 175,462 87,731 263,194 131,597 394,792 197,396 98,698 49,349 148,048 74,024 37,012 18,506 9,253 27,760 13,880 6,940 3,470 1,735 5,206 2,603 7,810 3,905 11,716 5,858 2,929 8,788 4,394 2,197 6,592 3,296 1,648 824 412

← Previous Integer #2,336,801 Browse Full Index Next Integer #2,336,803 →