3,766,166

2 × 929 × 2027

3,766,166 factors as 2 × 929 × 2027. Its 8 positive divisors give a proper-divisor sum of 1,891,954, so this integer is deficient. The Collatz stopping time is 110 steps.

Prime Factor Structure

Factorization String 2 × 929 × 2027

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 5,658,120

Proper Divisor Sum 1,891,954

Digit Sum / Digital Root 35 (Root: 8)

Adjacent Primes #3766153 ← → #3766207

Radix Representation

Decimal	3766166
Binary	1110010111011110010110 (22 bits)
Octal	0o16273626
Hexadecimal	0x397796

Divisor Catalog (8)

1 2 929 1,858 2,027 4,054 1,883,083 3,766,166

Collatz Trajectory (110 steps to reach 1)

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

3,766,166 1,883,083 5,649,250 2,824,625 8,473,876 4,236,938 2,118,469 6,355,408 3,177,704 1,588,852 794,426 397,213 1,191,640 595,820 297,910 148,955 446,866 223,433 670,300 335,150 167,575 502,726 251,363 754,090 377,045 1,131,136 565,568 282,784 141,392 70,696 35,348 17,674 8,837 26,512 13,256 6,628 3,314 1,657 4,972 2,486 1,243 3,730 1,865 5,596 2,798 1,399 4,198 2,099 6,298 3,149 9,448 4,724 2,362 1,181 3,544 1,772 886 443 1,330 665

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,766,165 Browse Full Index Next Integer #3,766,167 →