4,882,884

2² × 3 × 406907

4,882,884 factors as 2^2 × 3 × 406907. Its 12 positive divisors give a proper-divisor sum of 6,510,540, so this integer is abundant. The Collatz stopping time is 61 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 406907

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 11,393,424

Proper Divisor Sum 6,510,540

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #4882861 ← → #4882907

Radix Representation

Decimal	4882884
Binary	10010101000000111000100 (23 bits)
Octal	0o22500704
Hexadecimal	0x4A81C4

Divisor Catalog (12)

1 2 3 4 6 12 406,907 813,814 1,220,721 1,627,628 2,441,442 4,882,884

Collatz Trajectory (61 steps to reach 1)

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

4,882,884 2,441,442 1,220,721 3,662,164 1,831,082 915,541 2,746,624 1,373,312 686,656 343,328 171,664 85,832 42,916 21,458 10,729 32,188 16,094 8,047 24,142 12,071 36,214 18,107 54,322 27,161 81,484 40,742 20,371 61,114 30,557 91,672 45,836 22,918 11,459 34,378 17,189 51,568 25,784 12,892 6,446 3,223 9,670 4,835 14,506 7,253 21,760 10,880 5,440 2,720 1,360 680 340 170 85 256 128 64 32 16 8 4

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,882,883 Browse Full Index Next Integer #4,882,885 →