4,103,064

2³ × 3² × 7² × 1163

4,103,064 factors as 2^3 × 3^2 × 7^2 × 1163. Its 72 positive divisors give a proper-divisor sum of 8,834,796, so this integer is abundant. The Collatz stopping time is 105 steps.

Prime Factor Structure

Factorization String 2^3 × 3^2 × 7^2 × 1163

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 72

Divisor Sum (σ) 12,937,860

Proper Divisor Sum 8,834,796

Digit Sum / Digital Root 18 (Root: 9)

Adjacent Primes #4103009 ← → #4103083

Radix Representation

Decimal	4103064
Binary	1111101001101110011000 (22 bits)
Octal	0o17515630
Hexadecimal	0x3E9B98

Divisor Catalog (60 of 72)

1 2 3 4 6 7 8 9 12 14 18 21 24 28 36 42 49 56 63 72 84 98 126 147 168 196 252 294 392 441 504 588 882 1,163 1,176 1,764 2,326 3,489 3,528 4,652 6,978 8,141 9,304 10,467 13,956 16,282 20,934 24,423 27,912 32,564 41,868 48,846 56,987 65,128 73,269 83,736 97,692 113,974 146,538 170,961

Collatz Trajectory (105 steps to reach 1)

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

4,103,064 2,051,532 1,025,766 512,883 1,538,650 769,325 2,307,976 1,153,988 576,994 288,497 865,492 432,746 216,373 649,120 324,560 162,280 81,140 40,570 20,285 60,856 30,428 15,214 7,607 22,822 11,411 34,234 17,117 51,352 25,676 12,838 6,419 19,258 9,629 28,888 14,444 7,222 3,611 10,834 5,417 16,252 8,126 4,063 12,190 6,095 18,286 9,143 27,430 13,715 41,146 20,573 61,720 30,860 15,430 7,715 23,146 11,573 34,720 17,360 8,680 4,340

← Previous Integer #4,103,063 Browse Full Index Next Integer #4,103,065 →