2,829,558

2 × 3 × 471593

2,829,558 factors as 2 × 3 × 471593. Its 8 positive divisors give a proper-divisor sum of 2,829,570, so this integer is abundant. The Collatz stopping time is 107 steps.

Prime Factor Structure

Factorization String 2 × 3 × 471593

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 5,659,128

Proper Divisor Sum 2,829,570

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #2829557 ← → #2829569

Radix Representation

Decimal	2829558
Binary	1010110010110011110110 (22 bits)
Octal	0o12626366
Hexadecimal	0x2B2CF6

Divisor Catalog (8)

1 2 3 6 471,593 943,186 1,414,779 2,829,558

Collatz Trajectory (107 steps to reach 1)

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

2,829,558 1,414,779 4,244,338 2,122,169 6,366,508 3,183,254 1,591,627 4,774,882 2,387,441 7,162,324 3,581,162 1,790,581 5,371,744 2,685,872 1,342,936 671,468 335,734 167,867 503,602 251,801 755,404 377,702 188,851 566,554 283,277 849,832 424,916 212,458 106,229 318,688 159,344 79,672 39,836 19,918 9,959 29,878 14,939 44,818 22,409 67,228 33,614 16,807 50,422 25,211 75,634 37,817 113,452 56,726 28,363 85,090 42,545 127,636 63,818 31,909 95,728 47,864 23,932 11,966 5,983 17,950

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,829,557 Browse Full Index Next Integer #2,829,559 →