4,872,876

2² × 3 × 406073

4,872,876 factors as 2^2 × 3 × 406073. Its 12 positive divisors give a proper-divisor sum of 6,497,196, so this integer is abundant. The Collatz stopping time is 69 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 406073

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 11,370,072

Proper Divisor Sum 6,497,196

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #4872871 ← → #4872877

Radix Representation

Decimal	4872876
Binary	10010100101101010101100 (23 bits)
Octal	0o22455254
Hexadecimal	0x4A5AAC

Divisor Catalog (12)

1 2 3 4 6 12 406,073 812,146 1,218,219 1,624,292 2,436,438 4,872,876

Collatz Trajectory (69 steps to reach 1)

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

4,872,876 2,436,438 1,218,219 3,654,658 1,827,329 5,481,988 2,740,994 1,370,497 4,111,492 2,055,746 1,027,873 3,083,620 1,541,810 770,905 2,312,716 1,156,358 578,179 1,734,538 867,269 2,601,808 1,300,904 650,452 325,226 162,613 487,840 243,920 121,960 60,980 30,490 15,245 45,736 22,868 11,434 5,717 17,152 8,576 4,288 2,144 1,072 536 268 134 67 202 101 304 152 76 38 19 58 29 88 44 22 11 34 17 52 26

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,872,875 Browse Full Index Next Integer #4,872,877 →