3,166,604

2² × 7 × 113093

3,166,604 factors as 2^2 × 7 × 113093. Its 12 positive divisors give a proper-divisor sum of 3,166,660, so this integer is abundant. The Collatz stopping time is 71 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 113093

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 6,333,264

Proper Divisor Sum 3,166,660

Digit Sum / Digital Root 26 (Root: 8)

Adjacent Primes #3166577 ← → #3166613

Radix Representation

Decimal	3166604
Binary	1100000101000110001100 (22 bits)
Octal	0o14050614
Hexadecimal	0x30518C

Divisor Catalog (12)

1 2 4 7 14 28 113,093 226,186 452,372 791,651 1,583,302 3,166,604

Collatz Trajectory (71 steps to reach 1)

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

3,166,604 1,583,302 791,651 2,374,954 1,187,477 3,562,432 1,781,216 890,608 445,304 222,652 111,326 55,663 166,990 83,495 250,486 125,243 375,730 187,865 563,596 281,798 140,899 422,698 211,349 634,048 317,024 158,512 79,256 39,628 19,814 9,907 29,722 14,861 44,584 22,292 11,146 5,573 16,720 8,360 4,180 2,090 1,045 3,136 1,568 784 392 196 98 49 148 74 37 112 56 28 14 7 22 11 34 17

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,166,603 Browse Full Index Next Integer #3,166,605 →