759,090

2 × 3 × 5 × 25303

759,090 factors as 2 × 3 × 5 × 25303. Its 16 positive divisors give a proper-divisor sum of 1,062,798, so this integer is abundant. The Collatz stopping time is 131 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 25303

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,821,888

Proper Divisor Sum 1,062,798

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #759089 ← → #759103

Radix Representation

Decimal	759090
Binary	10111001010100110010 (20 bits)
Octal	0o2712462
Hexadecimal	0xB9532

Divisor Catalog (16)

1 2 3 5 6 10 15 30 25,303 50,606 75,909 126,515 151,818 253,030 379,545 759,090

Collatz Trajectory (131 steps to reach 1)

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

759,090 379,545 1,138,636 569,318 284,659 853,978 426,989 1,280,968 640,484 320,242 160,121 480,364 240,182 120,091 360,274 180,137 540,412 270,206 135,103 405,310 202,655 607,966 303,983 911,950 455,975 1,367,926 683,963 2,051,890 1,025,945 3,077,836 1,538,918 769,459 2,308,378 1,154,189 3,462,568 1,731,284 865,642 432,821 1,298,464 649,232 324,616 162,308 81,154 40,577 121,732 60,866 30,433 91,300 45,650 22,825 68,476 34,238 17,119 51,358 25,679 77,038 38,519 115,558 57,779 173,338

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #759,089 Browse Full Index Next Integer #759,091 →