4,153,386

2 × 3 × 23 × 30097

4,153,386 factors as 2 × 3 × 23 × 30097. Its 16 positive divisors give a proper-divisor sum of 4,514,838, so this integer is abundant. The Collatz stopping time is 167 steps.

Prime Factor Structure

Factorization String 2 × 3 × 23 × 30097

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 8,668,224

Proper Divisor Sum 4,514,838

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #4153367 ← → #4153393

Radix Representation

Decimal	4153386
Binary	1111110110000000101010 (22 bits)
Octal	0o17660052
Hexadecimal	0x3F602A

Divisor Catalog (16)

1 2 3 6 23 46 69 138 30,097 60,194 90,291 180,582 692,231 1,384,462 2,076,693 4,153,386

Collatz Trajectory (167 steps to reach 1)

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

4,153,386 2,076,693 6,230,080 3,115,040 1,557,520 778,760 389,380 194,690 97,345 292,036 146,018 73,009 219,028 109,514 54,757 164,272 82,136 41,068 20,534 10,267 30,802 15,401 46,204 23,102 11,551 34,654 17,327 51,982 25,991 77,974 38,987 116,962 58,481 175,444 87,722 43,861 131,584 65,792 32,896 16,448 8,224 4,112 2,056 1,028 514 257 772 386 193 580 290 145 436 218 109 328 164 82 41 124

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,153,385 Browse Full Index Next Integer #4,153,387 →