4,143,615

3 × 5 × 7 × 19 × 31 × 67

4,143,615 factors as 3 × 5 × 7 × 19 × 31 × 67. Its 64 positive divisors give a proper-divisor sum of 4,212,225, so this integer is abundant. The Collatz stopping time is 260 steps.

Prime Factor Structure

Factorization String 3 × 5 × 7 × 19 × 31 × 67

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 8,355,840

Proper Divisor Sum 4,212,225

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #4143613 ← → #4143617

Radix Representation

Decimal	4143615
Binary	1111110011100111111111 (22 bits)
Octal	0o17634777
Hexadecimal	0x3F39FF

Divisor Catalog (60 of 64)

1 3 5 7 15 19 21 31 35 57 67 93 95 105 133 155 201 217 285 335 399 465 469 589 651 665 1,005 1,085 1,273 1,407 1,767 1,995 2,077 2,345 2,945 3,255 3,819 4,123 6,231 6,365 7,035 8,835 8,911 10,385 12,369 14,539 19,095 20,615 26,733 31,155 39,463 43,617 44,555 61,845 72,695 118,389 133,665 197,315 218,085 276,241

Collatz Trajectory (260 steps to reach 1)

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

4,143,615 12,430,846 6,215,423 18,646,270 9,323,135 27,969,406 13,984,703 41,954,110 20,977,055 62,931,166 31,465,583 94,396,750 47,198,375 141,595,126 70,797,563 212,392,690 106,196,345 318,589,036 159,294,518 79,647,259 238,941,778 119,470,889 358,412,668 179,206,334 89,603,167 268,809,502 134,404,751 403,214,254 201,607,127 604,821,382 302,410,691 907,232,074 453,616,037 1,360,848,112 680,424,056 340,212,028 170,106,014 85,053,007 255,159,022 127,579,511 382,738,534 191,369,267 574,107,802 287,053,901 861,161,704 430,580,852 215,290,426 107,645,213 322,935,640 161,467,820 80,733,910 40,366,955 121,100,866 60,550,433 181,651,300 90,825,650 45,412,825 136,238,476 68,119,238 34,059,619

← Previous Integer #4,143,614 Browse Full Index Next Integer #4,143,616 →