1,925,574

2 × 3 × 7 × 19² × 127

1,925,574 factors as 2 × 3 × 7 × 19^2 × 127. Its 48 positive divisors give a proper-divisor sum of 2,756,154, so this integer is abundant. The Collatz stopping time is 52 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 19^2 × 127

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 4,681,728

Proper Divisor Sum 2,756,154

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #1925563 ← → #1925579

Radix Representation

Decimal	1925574
Binary	111010110000111000110 (21 bits)
Octal	0o7260706
Hexadecimal	0x1D61C6

Divisor Catalog (48)

1 2 3 6 7 14 19 21 38 42 57 114 127 133 254 266 361 381 399 722 762 798 889 1,083 1,778 2,166 2,413 2,527 2,667 4,826 5,054 5,334 7,239 7,581 14,478 15,162 16,891 33,782 45,847 50,673 91,694 101,346 137,541 275,082 320,929 641,858 962,787 1,925,574

Collatz Trajectory (52 steps to reach 1)

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

1,925,574 962,787 2,888,362 1,444,181 4,332,544 2,166,272 1,083,136 541,568 270,784 135,392 67,696 33,848 16,924 8,462 4,231 12,694 6,347 19,042 9,521 28,564 14,282 7,141 21,424 10,712 5,356 2,678 1,339 4,018 2,009 6,028 3,014 1,507 4,522 2,261 6,784 3,392 1,696 848 424 212 106 53 160 80 40 20 10 5 16 8 4 2 1

← Previous Integer #1,925,573 Browse Full Index Next Integer #1,925,575 →