3,764,712

2³ × 3 × 7 × 22409

3,764,712 factors as 2^3 × 3 × 7 × 22409. Its 32 positive divisors give a proper-divisor sum of 6,992,088, so this integer is abundant. The Collatz stopping time is 128 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 7 × 22409

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 10,756,800

Proper Divisor Sum 6,992,088

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3764711 ← → #3764759

Radix Representation

Decimal	3764712
Binary	1110010111000111101000 (22 bits)
Octal	0o16270750
Hexadecimal	0x3971E8

Divisor Catalog (32)

1 2 3 4 6 7 8 12 14 21 24 28 42 56 84 168 22,409 44,818 67,227 89,636 134,454 156,863 179,272 268,908 313,726 470,589 537,816 627,452 941,178 1,254,904 1,882,356 3,764,712

Collatz Trajectory (128 steps to reach 1)

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

3,764,712 1,882,356 941,178 470,589 1,411,768 705,884 352,942 176,471 529,414 264,707 794,122 397,061 1,191,184 595,592 297,796 148,898 74,449 223,348 111,674 55,837 167,512 83,756 41,878 20,939 62,818 31,409 94,228 47,114 23,557 70,672 35,336 17,668 8,834 4,417 13,252 6,626 3,313 9,940 4,970 2,485 7,456 3,728 1,864 932 466 233 700 350 175 526 263 790 395 1,186 593 1,780 890 445 1,336 668

← Previous Integer #3,764,711 Browse Full Index Next Integer #3,764,713 →