1,595,160

2³ × 3³ × 5 × 7 × 211

1,595,160 factors as 2^3 × 3^3 × 5 × 7 × 211. Its 128 positive divisors give a proper-divisor sum of 4,510,440, so this integer is abundant. The Collatz stopping time is 70 steps.

Prime Factor Structure

Factorization String 2^3 × 3^3 × 5 × 7 × 211

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 128

Divisor Sum (σ) 6,105,600

Proper Divisor Sum 4,510,440

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #1595149 ← → #1595173

Radix Representation

Decimal	1595160
Binary	110000101011100011000 (21 bits)
Octal	0o6053430
Hexadecimal	0x185718

Divisor Catalog (60 of 128)

1 2 3 4 5 6 7 8 9 10 12 14 15 18 20 21 24 27 28 30 35 36 40 42 45 54 56 60 63 70 72 84 90 105 108 120 126 135 140 168 180 189 210 211 216 252 270 280 315 360 378 420 422 504 540 630 633 756 840 844

Collatz Trajectory (70 steps to reach 1)

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

1,595,160 797,580 398,790 199,395 598,186 299,093 897,280 448,640 224,320 112,160 56,080 28,040 14,020 7,010 3,505 10,516 5,258 2,629 7,888 3,944 1,972 986 493 1,480 740 370 185 556 278 139 418 209 628 314 157 472 236 118 59 178 89 268 134 67 202 101 304 152 76 38 19 58 29 88 44 22 11 34 17 52

← Previous Integer #1,595,159 Browse Full Index Next Integer #1,595,161 →