1,000,002

2 × 3 × 166667

1,000,002 factors as 2 × 3 × 166667. Its 8 positive divisors give a proper-divisor sum of 1,000,014, so this integer is abundant. The Collatz stopping time is 113 steps.

Prime Factor Structure

Factorization String 2 × 3 × 166667

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 2,000,016

Proper Divisor Sum 1,000,014

Digit Sum / Digital Root 3 (Root: 3)

Adjacent Primes #999983 ← → #1000003

Radix Representation

Decimal	1000002
Binary	11110100001001000010 (20 bits)
Octal	0o3641102
Hexadecimal	0xF4242

Divisor Catalog (8)

1 2 3 6 166,667 333,334 500,001 1,000,002

Collatz Trajectory (113 steps to reach 1)

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

1,000,002 500,001 1,500,004 750,002 375,001 1,125,004 562,502 281,251 843,754 421,877 1,265,632 632,816 316,408 158,204 79,102 39,551 118,654 59,327 177,982 88,991 266,974 133,487 400,462 200,231 600,694 300,347 901,042 450,521 1,351,564 675,782 337,891 1,013,674 506,837 1,520,512 760,256 380,128 190,064 95,032 47,516 23,758 11,879 35,638 17,819 53,458 26,729 80,188 40,094 20,047 60,142 30,071 90,214 45,107 135,322 67,661 202,984 101,492 50,746 25,373 76,120 38,060

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,000,001 Browse Full Index Next Integer #1,000,003 →