4,106,230

2 × 5 × 410623

4,106,230 factors as 2 × 5 × 410623. Its 8 positive divisors give a proper-divisor sum of 3,285,002, so this integer is deficient. The Collatz stopping time is 154 steps.

Prime Factor Structure

Factorization String 2 × 5 × 410623

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 7,391,232

Proper Divisor Sum 3,285,002

Digit Sum / Digital Root 16 (Root: 7)

Adjacent Primes #4106227 ← → #4106237

Radix Representation

Decimal	4106230
Binary	1111101010011111110110 (22 bits)
Octal	0o17523766
Hexadecimal	0x3EA7F6

Divisor Catalog (8)

1 2 5 10 410,623 821,246 2,053,115 4,106,230

Collatz Trajectory (154 steps to reach 1)

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

4,106,230 2,053,115 6,159,346 3,079,673 9,239,020 4,619,510 2,309,755 6,929,266 3,464,633 10,393,900 5,196,950 2,598,475 7,795,426 3,897,713 11,693,140 5,846,570 2,923,285 8,769,856 4,384,928 2,192,464 1,096,232 548,116 274,058 137,029 411,088 205,544 102,772 51,386 25,693 77,080 38,540 19,270 9,635 28,906 14,453 43,360 21,680 10,840 5,420 2,710 1,355 4,066 2,033 6,100 3,050 1,525 4,576 2,288 1,144 572 286 143 430 215 646 323 970 485 1,456 728

← Previous Integer #4,106,229 Browse Full Index Next Integer #4,106,231 →