549,726

2 × 3 × 91621

549,726 factors as 2 × 3 × 91621. Its 8 positive divisors give a proper-divisor sum of 549,738, so this integer is abundant. The Collatz stopping time is 133 steps.

Prime Factor Structure

Factorization String 2 × 3 × 91621

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 1,099,464

Proper Divisor Sum 549,738

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #549719 ← → #549733

Radix Representation

Decimal	549726
Binary	10000110001101011110 (20 bits)
Octal	0o2061536
Hexadecimal	0x8635E

Divisor Catalog (8)

1 2 3 6 91,621 183,242 274,863 549,726

Collatz Trajectory (133 steps to reach 1)

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

549,726 274,863 824,590 412,295 1,236,886 618,443 1,855,330 927,665 2,782,996 1,391,498 695,749 2,087,248 1,043,624 521,812 260,906 130,453 391,360 195,680 97,840 48,920 24,460 12,230 6,115 18,346 9,173 27,520 13,760 6,880 3,440 1,720 860 430 215 646 323 970 485 1,456 728 364 182 91 274 137 412 206 103 310 155 466 233 700 350 175 526 263 790 395 1,186 593

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #549,725 Browse Full Index Next Integer #549,727 →