759,042

2 × 3² × 42169

759,042 factors as 2 × 3^2 × 42169. Its 12 positive divisors give a proper-divisor sum of 885,588, so this integer is abundant. The Collatz stopping time is 87 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 42169

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 1,644,630

Proper Divisor Sum 885,588

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #759037 ← → #759047

Radix Representation

Decimal	759042
Binary	10111001010100000010 (20 bits)
Octal	0o2712402
Hexadecimal	0xB9502

Divisor Catalog (12)

1 2 3 6 9 18 42,169 84,338 126,507 253,014 379,521 759,042

Collatz Trajectory (87 steps to reach 1)

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

759,042 379,521 1,138,564 569,282 284,641 853,924 426,962 213,481 640,444 320,222 160,111 480,334 240,167 720,502 360,251 1,080,754 540,377 1,621,132 810,566 405,283 1,215,850 607,925 1,823,776 911,888 455,944 227,972 113,986 56,993 170,980 85,490 42,745 128,236 64,118 32,059 96,178 48,089 144,268 72,134 36,067 108,202 54,101 162,304 81,152 40,576 20,288 10,144 5,072 2,536 1,268 634 317 952 476 238 119 358 179 538 269 808

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #759,041 Browse Full Index Next Integer #759,043 →