4,656,228

2² × 3 × 37 × 10487

4,656,228 factors as 2^2 × 3 × 37 × 10487. Its 24 positive divisors give a proper-divisor sum of 6,503,004, so this integer is abundant. The Collatz stopping time is 131 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 37 × 10487

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 11,159,232

Proper Divisor Sum 6,503,004

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #4656227 ← → #4656229

Radix Representation

Decimal	4656228
Binary	10001110000110001100100 (23 bits)
Octal	0o21606144
Hexadecimal	0x470C64

Divisor Catalog (24)

Collatz Trajectory (131 steps to reach 1)

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

4,656,228 2,328,114 1,164,057 3,492,172 1,746,086 873,043 2,619,130 1,309,565 3,928,696 1,964,348 982,174 491,087 1,473,262 736,631 2,209,894 1,104,947 3,314,842 1,657,421 4,972,264 2,486,132 1,243,066 621,533 1,864,600 932,300 466,150 233,075 699,226 349,613 1,048,840 524,420 262,210 131,105 393,316 196,658 98,329 294,988 147,494 73,747 221,242 110,621 331,864 165,932 82,966 41,483 124,450 62,225 186,676 93,338 46,669 140,008 70,004 35,002 17,501 52,504 26,252 13,126 6,563 19,690 9,845 29,536

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

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