2,932,940

2² × 5 × 146647

2,932,940 factors as 2^2 × 5 × 146647. Its 12 positive divisors give a proper-divisor sum of 3,226,276, so this integer is abundant. The Collatz stopping time is 89 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 146647

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 6,159,216

Proper Divisor Sum 3,226,276

Digit Sum / Digital Root 29 (Root: 2)

Adjacent Primes #2932933 ← → #2932957

Radix Representation

Decimal	2932940
Binary	1011001100000011001100 (22 bits)
Octal	0o13140314
Hexadecimal	0x2CC0CC

Divisor Catalog (12)

1 2 4 5 10 20 146,647 293,294 586,588 733,235 1,466,470 2,932,940

Collatz Trajectory (89 steps to reach 1)

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

2,932,940 1,466,470 733,235 2,199,706 1,099,853 3,299,560 1,649,780 824,890 412,445 1,237,336 618,668 309,334 154,667 464,002 232,001 696,004 348,002 174,001 522,004 261,002 130,501 391,504 195,752 97,876 48,938 24,469 73,408 36,704 18,352 9,176 4,588 2,294 1,147 3,442 1,721 5,164 2,582 1,291 3,874 1,937 5,812 2,906 1,453 4,360 2,180 1,090 545 1,636 818 409 1,228 614 307 922 461 1,384 692 346 173 520

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,932,939 Browse Full Index Next Integer #2,932,941 →