930,498

2 × 3 × 155083

930,498 factors as 2 × 3 × 155083. Its 8 positive divisors give a proper-divisor sum of 930,510, so this integer is abundant. The Collatz stopping time is 157 steps.

Prime Factor Structure

Factorization String 2 × 3 × 155083

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 1,861,008

Proper Divisor Sum 930,510

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #930491 ← → #930499

Radix Representation

Decimal	930498
Binary	11100011001011000010 (20 bits)
Octal	0o3431302
Hexadecimal	0xE32C2

Divisor Catalog (8)

1 2 3 6 155,083 310,166 465,249 930,498

Collatz Trajectory (157 steps to reach 1)

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

930,498 465,249 1,395,748 697,874 348,937 1,046,812 523,406 261,703 785,110 392,555 1,177,666 588,833 1,766,500 883,250 441,625 1,324,876 662,438 331,219 993,658 496,829 1,490,488 745,244 372,622 186,311 558,934 279,467 838,402 419,201 1,257,604 628,802 314,401 943,204 471,602 235,801 707,404 353,702 176,851 530,554 265,277 795,832 397,916 198,958 99,479 298,438 149,219 447,658 223,829 671,488 335,744 167,872 83,936 41,968 20,984 10,492 5,246 2,623 7,870 3,935 11,806 5,903

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #930,497 Browse Full Index Next Integer #930,499 →