3,930,690

2 × 3 × 5 × 131023

3,930,690 factors as 2 × 3 × 5 × 131023. Its 16 positive divisors give a proper-divisor sum of 5,503,038, so this integer is abundant. The Collatz stopping time is 185 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 131023

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 9,433,728

Proper Divisor Sum 5,503,038

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3930683 ← → #3930709

Radix Representation

Decimal	3930690
Binary	1110111111101001000010 (22 bits)
Octal	0o16775102
Hexadecimal	0x3BFA42

Divisor Catalog (16)

1 2 3 5 6 10 15 30 131,023 262,046 393,069 655,115 786,138 1,310,230 1,965,345 3,930,690

Collatz Trajectory (185 steps to reach 1)

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

3,930,690 1,965,345 5,896,036 2,948,018 1,474,009 4,422,028 2,211,014 1,105,507 3,316,522 1,658,261 4,974,784 2,487,392 1,243,696 621,848 310,924 155,462 77,731 233,194 116,597 349,792 174,896 87,448 43,724 21,862 10,931 32,794 16,397 49,192 24,596 12,298 6,149 18,448 9,224 4,612 2,306 1,153 3,460 1,730 865 2,596 1,298 649 1,948 974 487 1,462 731 2,194 1,097 3,292 1,646 823 2,470 1,235 3,706 1,853 5,560 2,780 1,390 695

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,930,689 Browse Full Index Next Integer #3,930,691 →