4,925,228

2² × 7 × 11 × 15991

4,925,228 factors as 2^2 × 7 × 11 × 15991. Its 24 positive divisors give a proper-divisor sum of 5,821,396, so this integer is abundant. The Collatz stopping time is 175 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 11 × 15991

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 10,746,624

Proper Divisor Sum 5,821,396

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #4925213 ← → #4925233

Radix Representation

Decimal	4925228
Binary	10010110010011100101100 (23 bits)
Octal	0o22623454
Hexadecimal	0x4B272C

Divisor Catalog (24)

Collatz Trajectory (175 steps to reach 1)

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

4,925,228 2,462,614 1,231,307 3,693,922 1,846,961 5,540,884 2,770,442 1,385,221 4,155,664 2,077,832 1,038,916 519,458 259,729 779,188 389,594 194,797 584,392 292,196 146,098 73,049 219,148 109,574 54,787 164,362 82,181 246,544 123,272 61,636 30,818 15,409 46,228 23,114 11,557 34,672 17,336 8,668 4,334 2,167 6,502 3,251 9,754 4,877 14,632 7,316 3,658 1,829 5,488 2,744 1,372 686 343 1,030 515 1,546 773 2,320 1,160 580 290 145

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,925,227 Browse Full Index Next Integer #4,925,229 →