2,947,764

2² × 3 × 61 × 4027

2,947,764 factors as 2^2 × 3 × 61 × 4027. Its 24 positive divisors give a proper-divisor sum of 4,044,844, so this integer is abundant. The Collatz stopping time is 120 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 61 × 4027

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 6,992,608

Proper Divisor Sum 4,044,844

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #2947741 ← → #2947781

Radix Representation

Decimal	2947764
Binary	1011001111101010110100 (22 bits)
Octal	0o13175264
Hexadecimal	0x2CFAB4

Divisor Catalog (24)

Collatz Trajectory (120 steps to reach 1)

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

2,947,764 1,473,882 736,941 2,210,824 1,105,412 552,706 276,353 829,060 414,530 207,265 621,796 310,898 155,449 466,348 233,174 116,587 349,762 174,881 524,644 262,322 131,161 393,484 196,742 98,371 295,114 147,557 442,672 221,336 110,668 55,334 27,667 83,002 41,501 124,504 62,252 31,126 15,563 46,690 23,345 70,036 35,018 17,509 52,528 26,264 13,132 6,566 3,283 9,850 4,925 14,776 7,388 3,694 1,847 5,542 2,771 8,314 4,157 12,472 6,236 3,118

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,947,763 Browse Full Index Next Integer #2,947,765 →