1,995,612

2² × 3 × 166301

1,995,612 factors as 2^2 × 3 × 166301. Its 12 positive divisors give a proper-divisor sum of 2,660,844, so this integer is abundant. The Collatz stopping time is 114 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 166301

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 4,656,456

Proper Divisor Sum 2,660,844

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #1995611 ← → #1995629

Radix Representation

Decimal	1995612
Binary	111100111001101011100 (21 bits)
Octal	0o7471534
Hexadecimal	0x1E735C

Divisor Catalog (12)

1 2 3 4 6 12 166,301 332,602 498,903 665,204 997,806 1,995,612

Collatz Trajectory (114 steps to reach 1)

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

1,995,612 997,806 498,903 1,496,710 748,355 2,245,066 1,122,533 3,367,600 1,683,800 841,900 420,950 210,475 631,426 315,713 947,140 473,570 236,785 710,356 355,178 177,589 532,768 266,384 133,192 66,596 33,298 16,649 49,948 24,974 12,487 37,462 18,731 56,194 28,097 84,292 42,146 21,073 63,220 31,610 15,805 47,416 23,708 11,854 5,927 17,782 8,891 26,674 13,337 40,012 20,006 10,003 30,010 15,005 45,016 22,508 11,254 5,627 16,882 8,441 25,324 12,662

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,995,611 Browse Full Index Next Integer #1,995,613 →