4,095,650

2 × 5² × 13 × 6301

4,095,650 factors as 2 × 5^2 × 13 × 6301. Its 24 positive divisors give a proper-divisor sum of 4,109,554, so this integer is abundant. The Collatz stopping time is 105 steps.

Prime Factor Structure

Factorization String 2 × 5^2 × 13 × 6301

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 8,205,204

Proper Divisor Sum 4,109,554

Digit Sum / Digital Root 29 (Root: 2)

Adjacent Primes #4095649 ← → #4095661

Radix Representation

Decimal	4095650
Binary	1111100111111010100010 (22 bits)
Octal	0o17477242
Hexadecimal	0x3E7EA2

Divisor Catalog (24)

Collatz Trajectory (105 steps to reach 1)

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

4,095,650 2,047,825 6,143,476 3,071,738 1,535,869 4,607,608 2,303,804 1,151,902 575,951 1,727,854 863,927 2,591,782 1,295,891 3,887,674 1,943,837 5,831,512 2,915,756 1,457,878 728,939 2,186,818 1,093,409 3,280,228 1,640,114 820,057 2,460,172 1,230,086 615,043 1,845,130 922,565 2,767,696 1,383,848 691,924 345,962 172,981 518,944 259,472 129,736 64,868 32,434 16,217 48,652 24,326 12,163 36,490 18,245 54,736 27,368 13,684 6,842 3,421 10,264 5,132 2,566 1,283 3,850 1,925 5,776 2,888 1,444 722

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,095,649 Browse Full Index Next Integer #4,095,651 →