1,925,588

2² × 7 × 68771

1,925,588 factors as 2^2 × 7 × 68771. Its 12 positive divisors give a proper-divisor sum of 1,925,644, so this integer is abundant. The Collatz stopping time is 96 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 68771

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 3,851,232

Proper Divisor Sum 1,925,644

Digit Sum / Digital Root 38 (Root: 2)

Adjacent Primes #1925579 ← → #1925603

Radix Representation

Decimal	1925588
Binary	111010110000111010100 (21 bits)
Octal	0o7260724
Hexadecimal	0x1D61D4

Divisor Catalog (12)

1 2 4 7 14 28 68,771 137,542 275,084 481,397 962,794 1,925,588

Collatz Trajectory (96 steps to reach 1)

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

1,925,588 962,794 481,397 1,444,192 722,096 361,048 180,524 90,262 45,131 135,394 67,697 203,092 101,546 50,773 152,320 76,160 38,080 19,040 9,520 4,760 2,380 1,190 595 1,786 893 2,680 1,340 670 335 1,006 503 1,510 755 2,266 1,133 3,400 1,700 850 425 1,276 638 319 958 479 1,438 719 2,158 1,079 3,238 1,619 4,858 2,429 7,288 3,644 1,822 911 2,734 1,367 4,102 2,051

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,925,587 Browse Full Index Next Integer #1,925,589 →