3,909,669

3 × 1303223

3,909,669 factors as 3 × 1303223. Its 4 positive divisors give a proper-divisor sum of 1,303,227, so this integer is deficient. The Collatz stopping time is 92 steps.

Prime Factor Structure

Factorization String 3 × 1303223

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 5,212,896

Proper Divisor Sum 1,303,227

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #3909667 ← → #3909671

Radix Representation

Decimal	3909669
Binary	1110111010100000100101 (22 bits)
Octal	0o16724045
Hexadecimal	0x3BA825

Divisor Catalog (4)

1 3 1,303,223 3,909,669

Collatz Trajectory (92 steps to reach 1)

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

3,909,669 11,729,008 5,864,504 2,932,252 1,466,126 733,063 2,199,190 1,099,595 3,298,786 1,649,393 4,948,180 2,474,090 1,237,045 3,711,136 1,855,568 927,784 463,892 231,946 115,973 347,920 173,960 86,980 43,490 21,745 65,236 32,618 16,309 48,928 24,464 12,232 6,116 3,058 1,529 4,588 2,294 1,147 3,442 1,721 5,164 2,582 1,291 3,874 1,937 5,812 2,906 1,453 4,360 2,180 1,090 545 1,636 818 409 1,228 614 307 922 461 1,384 692

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,909,668 Browse Full Index Next Integer #3,909,670 →