753,366

2 × 3 × 241 × 521

753,366 factors as 2 × 3 × 241 × 521. Its 16 positive divisors give a proper-divisor sum of 762,522, so this integer is abundant. The Collatz stopping time is 149 steps.

Prime Factor Structure

Factorization String 2 × 3 × 241 × 521

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,515,888

Proper Divisor Sum 762,522

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #753353 ← → #753367

Radix Representation

Decimal	753366
Binary	10110111111011010110 (20 bits)
Octal	0o2677326
Hexadecimal	0xB7ED6

Divisor Catalog (16)

1 2 3 6 241 482 521 723 1,042 1,446 1,563 3,126 125,561 251,122 376,683 753,366

Collatz Trajectory (149 steps to reach 1)

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

753,366 376,683 1,130,050 565,025 1,695,076 847,538 423,769 1,271,308 635,654 317,827 953,482 476,741 1,430,224 715,112 357,556 178,778 89,389 268,168 134,084 67,042 33,521 100,564 50,282 25,141 75,424 37,712 18,856 9,428 4,714 2,357 7,072 3,536 1,768 884 442 221 664 332 166 83 250 125 376 188 94 47 142 71 214 107 322 161 484 242 121 364 182 91 274 137

← Previous Integer #753,365 Browse Full Index Next Integer #753,367 →