2,332,002

2 × 3 × 67 × 5801

2,332,002 factors as 2 × 3 × 67 × 5801. Its 16 positive divisors give a proper-divisor sum of 2,402,430, so this integer is abundant. The Collatz stopping time is 117 steps.

Prime Factor Structure

Factorization String 2 × 3 × 67 × 5801

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 4,734,432

Proper Divisor Sum 2,402,430

Digit Sum / Digital Root 12 (Root: 3)

Adjacent Primes #2331997 ← → #2332013

Radix Representation

Decimal	2332002
Binary	1000111001010101100010 (22 bits)
Octal	0o10712542
Hexadecimal	0x239562

Divisor Catalog (16)

1 2 3 6 67 134 201 402 5,801 11,602 17,403 34,806 388,667 777,334 1,166,001 2,332,002

Collatz Trajectory (117 steps to reach 1)

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

2,332,002 1,166,001 3,498,004 1,749,002 874,501 2,623,504 1,311,752 655,876 327,938 163,969 491,908 245,954 122,977 368,932 184,466 92,233 276,700 138,350 69,175 207,526 103,763 311,290 155,645 466,936 233,468 116,734 58,367 175,102 87,551 262,654 131,327 393,982 196,991 590,974 295,487 886,462 443,231 1,329,694 664,847 1,994,542 997,271 2,991,814 1,495,907 4,487,722 2,243,861 6,731,584 3,365,792 1,682,896 841,448 420,724 210,362 105,181 315,544 157,772 78,886 39,443 118,330 59,165 177,496 88,748

← Previous Integer #2,332,001 Browse Full Index Next Integer #2,332,003 →