4,476,352

2⁶ × 23 × 3041

4,476,352 factors as 2^6 × 23 × 3041. Its 28 positive divisors give a proper-divisor sum of 4,795,664, so this integer is abundant. The Collatz stopping time is 61 steps.

Prime Factor Structure

Factorization String 2^6 × 23 × 3041

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 28

Divisor Sum (σ) 9,272,016

Proper Divisor Sum 4,795,664

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #4476341 ← → #4476379

Radix Representation

Decimal	4476352
Binary	10001000100110111000000 (23 bits)
Octal	0o21046700
Hexadecimal	0x444DC0

Divisor Catalog (28)

Collatz Trajectory (61 steps to reach 1)

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

4,476,352 2,238,176 1,119,088 559,544 279,772 139,886 69,943 209,830 104,915 314,746 157,373 472,120 236,060 118,030 59,015 177,046 88,523 265,570 132,785 398,356 199,178 99,589 298,768 149,384 74,692 37,346 18,673 56,020 28,010 14,005 42,016 21,008 10,504 5,252 2,626 1,313 3,940 1,970 985 2,956 1,478 739 2,218 1,109 3,328 1,664 832 416 208 104 52 26 13 40 20 10 5 16 8 4

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,476,351 Browse Full Index Next Integer #4,476,353 →